Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
Implementing an efficient part-of-speech tagger
Software—Practice & Experience
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Incremental finite-state parsing
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Regular expressions for language engineering
Natural Language Engineering
GramCheck: a grammar and style checker
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
Writing aids such as spelling and grammar checkers are often based on texts by adult writers and are not sufficiently targeted to support children in their writing process. This paper reports on the development of a writing tool based on a corpus of Swedish text written by children and on the parsing methods developed to handle text containing errors. The system uses finite state techniques for finding grammar errors without actually specifying the error. The 'broadness' of the grammar and the lexical ambiguity in words, necessary for parsing text containing errors, also yields ambiguous and/or alternative phrase annotations. We block some of the (erroneous) alternative parses by the order in which phrase segments are selected, which causes bleeding of some rules and more 'correct' parsing results are achieved. The technique shows good coverage results for agreement and verb selection phenomena.