An efficient context-free parsing algorithm
Communications of the ACM
The experience of developing a large-scale natural language text processing system: CRITIQUE
ANLC '88 Proceedings of the second conference on Applied natural language processing
Recognizing syntactic errors in the writing of second language learners
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A rule-based approach to ill-formed input
COLING '80 Proceedings of the 8th conference on Computational linguistics
GramCheck: a grammar and style checker
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
This article presents the central algorithm of an open system for grammar checking, based on deep parsing. The grammatical specification is a context-free grammar with flat feature structures. After a shared-forest analysis where feature agreement constraints are relaxed, error detection globally minimizes the number of corrections and alternative correct sentences are automatically proposed.