Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Automatic Rule Acquisition for Spelling Correction
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Corpus-based syntactic error detection using syntactic patterns
Proceedings of the workshop on Student research
Meta-rules as a basis for processing ill-formed input
Computational Linguistics - Special issue on ill-formed input
Integrated control of chart items for error repair
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Combining Trigram-based and feature-based methods for context-sensitive spelling correction
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Finite-state transducer cascades to extract named entities in texts
Theoretical Computer Science - Implementation and application automata
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Foma: a finite-state compiler and library
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
GenERRate: generating errors for use in grammatical error detection
EdAppsNLP '09 Proceedings of the Fourth Workshop on Innovative Use of NLP for Building Educational Applications
The EPISTLE text-critiquing system
IBM Systems Journal
The effect of correcting grammatical errors on parse probabilities
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Positive grammar checking: a finite state approach
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Finite-state machine construction methods and algorithms for phonology and morphology
Finite-state machine construction methods and algorithms for phonology and morphology
"cba to check the spelling" investigating parser performance on discussion forum posts
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Dealing With Complex Linguistic Annotations Within a Language Processing Framework
IEEE Transactions on Audio, Speech, and Language Processing
Hi-index | 0.00 |
This paper presents a set of experiments for the detection and correction of syntactic errors, exploring two alternative approaches. The first one uses an error grammar which combines a robust morphosyntactic analyser and two groups of finite-state transducers (one for the description of syntactic error patterns and the other for the correction of the detected errors). We have also experimented an alternative approach using a positive date grammar where deviations are detected by applying edit-distance techniques. The system has been tested on a corpus of real texts which contained both correct and incorrect sentences. Although the experiment was limited to one language, the results show that attainable performance is not the only criterion for preferring one solution over another.