The String-to-String Correction Problem
Journal of the ACM (JACM)
Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
Order-n correction for regular languages
Communications of the ACM
Spelling correction in systems programs
Communications of the ACM
A technique for computer detection and correction of spelling errors
Communications of the ACM
An error-correcting parse algorithm
Communications of the ACM
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Compact encoding of probabilistic languages
Compact encoding of probabilistic languages
Formal languages and their relation to automata
Formal languages and their relation to automata
Applying Probability Measures to Abstract Languages
IEEE Transactions on Computers
IEEE Transactions on Computers
Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
IEEE Transactions on Computers
Stochastic Syntactic Decoding for Pattern Classification
IEEE Transactions on Computers
A Stochastic Syntax Analysis Procedure and Its Application to Pattern Classification
IEEE Transactions on Computers
Probabilistic representation of formal languages
SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
Error detection in formal languages
Journal of Computer and System Sciences
Pattern Recognition and Image Processing
IEEE Transactions on Computers
Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns
IEEE Transactions on Computers
| Hi-index | 14.99 |
Error correction of programming languages has been effected in a heuristic fashion; error correction in the information-theoretic sense is very precise. The missing link is provided through probabilistic grammars. This paper provides the theoretical foundation for the precise construction of an error correcting compiler. The concept of code distance is extended to account for syntax in language. Grammar modifications are demonstrated so that a probabilistic parsing algorithm corrects various kinds of linguistic errors using an ideal observer rule. A generalized error correcting algorithm is described.