Language Correction Using Probabilistic Grammars
- 1 March 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-25 (3), 275-286
- https://doi.org/10.1109/tc.1976.5009254
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- Maximum-likelihood syntactic decodingIEEE Transactions on Information Theory, 1975
- Stochastic Syntactic Decoding for Pattern ClassificationIEEE Transactions on Computers, 1975
- Syntax-directed least-errors analysis for context-free languagesCommunications of the ACM, 1974
- Applying Probability Measures to Abstract LanguagesIEEE Transactions on Computers, 1973
- A Stochastic Syntax Analysis Procedure and Its Application to Pattern ClassificationIEEE Transactions on Computers, 1972
- Error detection in formal languagesJournal of Computer and System Sciences, 1970
- Spelling correction in systems programsCommunications of the ACM, 1970
- Probabilistic representation of formal languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1969
- A technique for computer detection and correction of spelling errorsCommunications of the ACM, 1964
- An error-correcting parse algorithmCommunications of the ACM, 1963