This paper describes how a treebank of ungrammatical sentences can be created from a treebank of well-formed sentences. The treebank creation procedure involves the automatic introduction of frequently occurring grammatical errors into the sentences in an existing treebank, and the minimal transformation of the analyses in the treebank so that they describe the newly created ill-formed sentences. Such a treebank can be used to test how well a parser is able to ignore grammatical errors in texts (as people can), and can be used to induce a grammar capable of analysing such sentences. This paper also demonstrates the first of these uses
Manual development of deep linguistic resources is time-consuming and costly and therefore often des...
textThis paper reports a preliminary result on automatic grammar induction based on the framework of...
Manual, large scale (computational) grammar development is time consuming, expensive and requires lo...
This paper describes how a treebank of ungrammatical sentences can be created from a treebank of we...
This article describes how a treebank of ungrammatical sentences can be created from a treebank of w...
We present a robust parser which is trained on a treebank of ungrammatical sentences. The treebank i...
This paper explores the issue of automatically generated ungrammatical data and its use in error det...
This paper describes how electronic grammars can be further enhanced by adding machine-readable gram...
1. Introduct ion Treebanks have become valuable resources in natural language processing (NLP) in re...
Treebanks have become valuable resources in natural language processing (NLP) in recent years (Abeil...
Proceedings of the 16th Nordic Conference of Computational Linguistics NODALIDA-2007. Editors: Jo...
Today's grammar checkers often use hand-crafted rule systems that define acceptable language. The de...
Treebanks, such as the Penn Treebank, provide a basis for the automatic creation of broad coverage g...
Over the past 15 years, there has been increasing use of linguis-tically annotated sentence collecti...
By a \tree-bank grammar " we mean a context-free grammar cre-ated by reading the production rul...
Manual development of deep linguistic resources is time-consuming and costly and therefore often des...
textThis paper reports a preliminary result on automatic grammar induction based on the framework of...
Manual, large scale (computational) grammar development is time consuming, expensive and requires lo...
This paper describes how a treebank of ungrammatical sentences can be created from a treebank of we...
This article describes how a treebank of ungrammatical sentences can be created from a treebank of w...
We present a robust parser which is trained on a treebank of ungrammatical sentences. The treebank i...
This paper explores the issue of automatically generated ungrammatical data and its use in error det...
This paper describes how electronic grammars can be further enhanced by adding machine-readable gram...
1. Introduct ion Treebanks have become valuable resources in natural language processing (NLP) in re...
Treebanks have become valuable resources in natural language processing (NLP) in recent years (Abeil...
Proceedings of the 16th Nordic Conference of Computational Linguistics NODALIDA-2007. Editors: Jo...
Today's grammar checkers often use hand-crafted rule systems that define acceptable language. The de...
Treebanks, such as the Penn Treebank, provide a basis for the automatic creation of broad coverage g...
Over the past 15 years, there has been increasing use of linguis-tically annotated sentence collecti...
By a \tree-bank grammar " we mean a context-free grammar cre-ated by reading the production rul...
Manual development of deep linguistic resources is time-consuming and costly and therefore often des...
textThis paper reports a preliminary result on automatic grammar induction based on the framework of...
Manual, large scale (computational) grammar development is time consuming, expensive and requires lo...