Journal of the ACM (JACM)
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
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
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
A Stochastic Syntax Analysis Procedure and Its Application to Pattern Classification
IEEE Transactions on Computers
Error detection in formal languages
Journal of Computer and System Sciences
A statistical analysis of syntax errors
Computer Languages
| Hi-index | 14.98 |
A formal method of correcting errors of changed, deleted, and inserted terminals in the strings of a context-free language is considered. Grammars generating strings containing these errors are first constructed from a known grammar for the language; these new grammars are then used to specify simple syntax-directed translation schemata which can parse both correct strings and strings with errors and simultaneously produce output strings in the original language. Stochastic aspects of productions and of errors are incorporated into the correction model to assign probabilities to translations produced.