Robert A. Wagner
Abstract
A method is presented for calculating a string B, belonging to a given regular language L, which is “nearest” (in number of edit operations) to a given input string α. B is viewed as a reasonable “correction” for the possibly erroneous string α, where α was originally intended to be a string of L. The calculation of B by the method presented requires time proportional to |α|, the number of characters in α. The method should find applications in information retrieval, artificial intelligence, and spelling correction systems.
- 1 Conway, R.W., and Maxwell, W.L. CORC--the Cornell computing language. Comm. ACM 6, 9 (Sept. 1966), 317-321. Google Scholar
Digital Library
- 2 Morgan, H.L., and Wagner, R.A. PL/C--A high performance compiler for PL/I. Proc. 1971 SJCC, Vol. 38, AFIPS Press, Montvale, N.J., pp. 503-510.Google Scholar
- 3 Morgan, H.L. Spelling correction in systems programs. Comm. ACM 13, 2 (Feb. 1970), 90-94. Google ScholarDigital Library
- 4 Wagner, R.A. An n 3 minimum edit distance correction algorithm for context free languages. Tech. Rep., Systems and Information Science Dep., Vanderbilt U., Nashville, Tenn., 1972.Google Scholar
- 5 Nemhauser, G,L. introduction to Dynamic Programming. Wiley, New York, 1966.Google Scholar
- 6 Wagner, R.A. The string-to-string correction problem. Tech. Rep., Systems and Information Sciences Dep., Vanderbilt U., Nashville, Tenn., 1971.Google Scholar
- 7 Floyd, R.W. Algorithm 97--Shortest path. Comm. ACM 5, 6 (June 1962), 345. Google ScholarDigital Library
- 8 Gries, D. Compiler Construction Jbr Digital Computers. Wiley, New York, 1971. Google ScholarDigital Library
- 9 LaFrance, J.E. Syntax-directed error recovery for compilers. Ph.D. Th., Rep. No. 459, Dep. of Comput. Sci., U. of Illinois at Urbana-Champaign, Urbana, 111., June 1971. Google ScholarDigital Library
- 10 Irons, E.T. An error-correcting parse algorithm. Comm. ACM 13, 11 (Nov. 1963), 669-673. Google ScholarDigital Library
- 11 Leinus, R. Error detection and recovery in syntax-directed compilers. Ph.D. Th., U. of Wisconsin, Madison, Wis., 1970. Google ScholarDigital Library
- 12 Levy, J-P. Automatic correction of syntax errors in programming languages. Ph.D. Th., Dep. of Comput. Sci., Cornell U., Ithaca, N.Y. 1971. Google ScholarDigital Library
Index Terms
- Order-n correction for regular languages
Recommendations
Correcting Counter-Automaton-Recognizable Languages
Correction of a string x into a language L is the problem of finding a string $y \in L$ to which x can be edited at least cost. The edit operations considered here are single-character deletions, single-character insertions, and single-character ...
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer ScienceIn this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...
Regular Expressions for Languages over Infinite Alphabets
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is accepted by finite-state unification based automaton - a model of ...
Comments