Journal of the ACM (JACM)
Derivatives of Regular Expressions
Journal of the ACM (JACM)
A technique for computer detection and correction of spelling errors
Communications of the ACM
Formal languages and their relation to automata
Formal languages and their relation to automata
Estimation, Prediction, and Smoothing in Discrete Parameter Systems
IEEE Transactions on Computers
Error detection in formal languages
Journal of Computer and System Sciences
Stochastic Syntactic Decoding for Pattern Classification
IEEE Transactions on Computers
Error-Correcting Parsers for Formal Languages
IEEE Transactions on Computers
Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages
IEEE Transactions on Computers
Language Correction Using Probabilistic Grammars
IEEE Transactions on Computers
| Hi-index | 14.99 |
Random occurrences of three types of errors in the input to a finite automaton are considered: an a error is a deletion of one symbol from the input string; a β error is an insertion of one extra symbol; and a d error is a change of one symbol into another symbol. A method using operators for determining regular expressions defining error-corrupted strings is developed and is employed in the construction of a finite automaton, the outputs of which are stochastically generated by Bayes' Rule (with certain approximations) to take into account the frequencies with which strings appear as inputs and the probabilities of errors.