Prolog and natural-language analysis
Prolog and natural-language analysis
An efficient context-free parsing algorithm
Communications of the ACM
A maximum-entropy-inspired parser
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Corpus-based syntactic error detection using syntactic patterns
Proceedings of the workshop on Student research
Parse fitting and prose fixing: getting a hold on ill-formedness
Computational Linguistics - Special issue on ill-formed input
Meta-rules as a basis for processing ill-formed input
Computational Linguistics - Special issue on ill-formed input
Recognizing syntactic errors in the writing of second language learners
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Some chart-based techniques for parsing ill-formed input
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Efficiency, robustness and accuracy in Picky chart parsing
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
A toolkit to assist L2 learners become independent writers
CL&W '10 Proceedings of the NAACL HLT 2010 Workshop on Computational Linguistics and Writing: Writing Processes and Authoring Aids
Reducing overdetections in a French symbolic grammar checker by classification
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part II
Correcting different types of errors in texts
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
On Morphological Analysis for Learner Language, Focusing on Russian
Research on Language and Computation
| Hi-index | 0.02 |
This paper presents a robust parsing approach which is designed to address the issue of syntactic errors in text. The approach is based on the concept of an error grammar which is a grammar of ungrammatical sentences. An error grammar is derived from a conventional grammar on the basis of an analysis of a corpus of observed ill-formed sentences. A robust parsing algorithm is presented which is applied after a conventional bottom–up parsing algorithm has failed. This algorithm combines a rule from the error grammar with rules from the normal grammar to arrive at a parse for an ungrammatical sentence. This algorithm is applied to 50 test sentences, with encouraging results.