An efficient augmented-context-free parsing algorithm
Computational Linguistics
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Computer programs for detecting and correcting spelling errors
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Language As a Cognitive Process: Syntax
Language As a Cognitive Process: Syntax
Lattice-based word identification in CLARE
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Contribution of a category hierarchy to the robustness of syntactic parsing.
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
A linguistic theory of robustness
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
We present a morpho-syntactic analyzer for French which is capable of automatically detecting and of correcting (automatically or with user help) spelling mistakes, agreement errors and certain frequently encountered syntactic errors. Emphasizing the specific language knowledge that is used, we describe the major subtasks of this analyzer: word categorization by dictionary look-up and spelling correction, construction of a parse tree or of a forest of parse trees, correction of syntactic and morphological errors by processing the parse tree. The spelling corrector module is designed to help correct the spelling mistakes of a French novice, as opposed to those of an experienced typist. The syntax analysis module is driven by an empirical grammar for French and is based on the work of Tomita. The presentation is based on the design and implementation of a prototype of the system which is written in Lisp for the Macintosh computer.