Looking for Errors: A Declarative Formalism for Resource-adaptive Language Checking

The paper describes a phenomenon-based approach to grammar checking, which draws on the integration of different shallow NLP technologies, including morphological and POS taggers, as well as probabilistic and rule-based partial parsers. We present a declarative specification formalism for grammar checking and controlled language applications which greatly facilitates the development of checking components.

[1]  Wojciech Skut,et al.  Chunk Tagger - Statistical Recognition of Noun Phrases , 1998, ArXiv.

[2]  Jaime G. Carbonell,et al.  Coping with Extragrammaticality , 1984, ACL.

[3]  JensenK.,et al.  Parse fitting and prose fixing , 1983 .

[4]  Gregor Thurmair.  Parsing for Grammar and Style Checking , 1990, COLING.

[5]  Michael Carl,et al.  Shallow Post Morphological Processing with KURD , 1998, CoNLL.

[6]  Jan van Leeuwen,et al.  Handbook Of Theoretical Computer Science, Vol. A , 1990 .

[7]  Thorsten Brants,et al.  TnT – A Statistical Part-of-Speech Tagger , 2000, ANLP.

[8]  Lance A. Miller,et al.  Parse Fitting and Prose Fixing , 1993, Natural Language Processing.

[9]  Gregory Grefenstette,et al.  Regular expressions for language engineering , 1996, Natural Language Engineering.

[10]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[11]  Günter Neumann,et al.  An Information Extraction Core System for Real World German Text Processing , 1997, ANLP.

[12]  Jaime G. Carbonell,et al.  Recovery Strategies for Parsing Extragrammatical Language , 1983, CL.

[13]  Lance A. Miller,et al.  Parse Fitting and Prose Fixing: Getting a Hold on III-Formedness , 1983, Am. J. Comput. Linguistics.

[14]  Alfred V. Aho,et al.  Algorithms for Finding Patterns in Strings , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[15]  Thierry Lecroq,et al.  Exact string matching algorithms , 1997 .