Adaptive correction of program statements
Communications of the ACM
An efficient context-free parsing algorithm
Communications of the ACM
Communications of the ACM
EULER: a generalization of ALGOL, and its formal definition: Part II
Communications of the ACM
Design of a separable transition-diagram compiler
Communications of the ACM
An error-correcting parse algorithm
Communications of the ACM
Context-free error analysis by evaluation of algebraic power series
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Formal development of correct algorithms: An example based on earley's recogniser
Proceedings of ACM conference on Proving assertions about programs
Dynamic Programming
An efficient context-free parsing algorithm
An efficient context-free parsing algorithm
Error detection and recovery for syntax directed compiler systems
Error detection and recovery for syntax directed compiler systems
A syntax-directed least-errors recognizer for context-free languages
A syntax-directed least-errors recognizer for context-free languages
Automatic correction of syntax errors in programming languages
Automatic correction of syntax errors in programming languages
Syntax-directed error recovery for compilers
Syntax-directed error recovery for compilers
Syntax error detection, correction and recovery in parsers
Syntax error detection, correction and recovery in parsers
Optimization of error recovery in syntax-directed parsing algorithms
ACM SIGPLAN Notices
Formal languages and their relation to automata
Formal languages and their relation to automata
Noncorrecting syntax error recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Determining the extent of lookahead in syntactic error repair
ACM Transactions on Programming Languages and Systems (TOPLAS)
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
Using expectation to enable spoken variable initiative dialog
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Error repair in shift-reduce parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
An architecture for voice dialog systems based on prolog-style theorem proving
Computational Linguistics
ACM Computing Surveys (CSUR)
Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Locally Least-Cost Error Recovery in Earley's Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical syntactic error recovery
Communications of the ACM
MPACT: microprocessor application to control-firmware translator
ACM SIGDA Newsletter
Using dynamic programming to generate optimized code in a Graham-Glanville style code generator
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
An efficient insertion-only error-corrector for LL(1) parsers
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
On line context free language recognition in less than cubic time(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Locally minimum-distance correction of syntax errors in programming languages
ACM '80 Proceedings of the ACM 1980 annual conference
Fault-tolerant string processing by pattern mapping
ACM '77 Proceedings of the 1977 annual conference
A dialog control algorithm and its performance
ANLC '92 Proceedings of the third conference on Applied natural language processing
A robust parser based on syntactic information
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Integrated control of chart items for error repair
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
A formal frame for robust parsing
Theoretical Computer Science - Implementation and application of automata
The intractability of computing the Hamming distance
Theoretical Computer Science
Syntactic Recognition of Imperfectly Specified Patterns
IEEE Transactions on Computers
Recognition of Spoken Words and Phrases in Multitalker Environment Using Syntactic Methods
IEEE Transactions on Computers
Error-Correcting Tree Automata for Syntactic Pattern Recognition
IEEE Transactions on Computers
Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages
IEEE Transactions on Computers
A General Method for Transforming Standard Parsers into Error-Repair Parsers
CICLing '09 Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing
Language Correction Using Probabilistic Grammars
IEEE Transactions on Computers
Theoretical Computer Science
Robust parsing using dynamic programming
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Managing misspelled queries in IR applications
Information Processing and Management: an International Journal
Natural and flexible error recovery for generated parsers
SLE'09 Proceedings of the Second international conference on Software Language Engineering
Approximate matching between a context-free grammar and a finite-state automaton
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 48.25 |
A least-errors recognizer is developed informally using the well-known recognizer of Earley, along with elements of Bellman's dynamic programming. The analyzer takes a general class of context-free grammars as drivers, and any finite string as input. Recognition consists of a least-errors count for a corrected version of the input relative to the driver grammar. The algorithm design emphasizes practical aspects which help in programming it.