Parsing techniques: a practical guide
Parsing techniques: a practical guide
Parsing schemata and correctness of parsing algorithms
AMiLP '95 Proceedings of the first international AMAST workshop on Algebraic methods in language processing
Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
An efficient context-free parsing algorithm
Communications of the ACM
Error repair with validation in LR-based parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Repairing syntax errors in LR-based parsers
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Repairing syntax errors in LR parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stochastic Error-Correcting Parsing for OCR Post-Processing
ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 4
Some chart-based techniques for parsing ill-formed input
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Charting the depths of robust speech parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
A formal frame for robust parsing
Theoretical Computer Science - Implementation and application of automata
Syntax error repair for a Java-based parser generator
ACM SIGPLAN Notices
A compiler for parsing schemata
Software—Practice & Experience
| Hi-index | 5.23 |
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair parsing approaches achieve robustness by considering ungrammatical sentences as corrupted versions of valid sentences. In this article we present a deductive formalism, based on Sikkel's parsing schemata, that can be used to define and relate error-repair parsers and study their formal properties, such as correctness. This formalism allows us to define a general transformation technique to automatically obtain robust, error-repair parsers from standard non-robust parsers. If our method is applied to a correct parsing schema verifying certain conditions, the resulting error-repair parsing schema is guaranteed to be correct. The required conditions are weak enough to be fulfilled by a wide variety of popular parsers used in natural language processing, such as CYK, Earley and Left-Corner.