# Order-n correction for regular languages

@article{Wagner1974OrdernCF, title={Order-n correction for regular languages}, author={Robert A. Wagner}, journal={Commun. ACM}, year={1974}, volume={17}, pages={265-268} }

A method is presented for calculating a string <italic>B</italic>, belonging to a given regular language <italic>L</italic>, which is “nearest” (in number of edit operations) to a given input string <italic>α</italic>. <italic>B</italic> is viewed as a reasonable “correction” for the possibly erroneous string <italic>α</italic>, where <italic>α</italic> was originally intended to be a string of <italic>L</italic>. The calculation of <italic>B</italic> by the method presented requires time…

## 123 Citations

### OCR Error Correction of an Inflectional Indian Language Using Morphological Parsing

- LinguisticsJ. Inf. Sci. Eng.
- 2000

This paper deals with an OCR (Optical Character Recognition) error detection and correction technique for a highly inflectional Indian language, Bangla, the second-most popular language in India and…

### The Edit-Distance between a Regular Language and a Context-Free Language

- Computer ScienceInt. J. Found. Comput. Sci.
- 2013

A polynomial time algorithm is designed that calculates the edit-distance of a given regular language and a given context-free language based on unary homomorphisms.

### Correcting Counter-Automaton-Recognizable Languages

- Computer ScienceSIAM J. Comput.
- 1978

Using a linear-time algorithm for solving single-origin graph shortest distance problems, it is shown how to correct a string of length n into the language accepted by a counter automaton in time proportional to $n^2 $ on a RAM with unit operation cost function.

### How Hard Is Computing the Edit Distance?

- Computer ScienceInf. Comput.
- 2001

This paper presents a parallel algorithm for computing the edit distance for the class of languages accepted by one-way nondeterministic auxiliary pushdown automata working in polynomial time, a class that strictly contains context?free languages.

### Techniques for automatically correcting words in text

- Computer ScienceCSUR
- 1992

Research aimed at correcting words in text has focused on three progressively more difficult problems: nonword error detection; (2) isolated-word error correction; and (3) context-dependent work correction, which surveys documented findings on spelling error patterns.

### Automatic error recovery for LR parsers in theory and practice

- Computer Science
- 1989

The need for good syntax error handling schemes in language translation systems such as compilers, and for the automatic incorporation of such schemes into parser-generators, is argued.

### FarsiSpell: A spell-checking system for Persian using a large monolingual corpus

- Computer Science, LinguisticsLit. Linguistic Comput.
- 2014

It has been tried to demonstrate the effectiveness of a large monolingual corpus of Persian in improving the output quality of a spell-checker developed for this language.

### An effective algorithm for string correction using generalized edit distance - II. Computational complexity of the algorithm and some applications

- Computer ScienceInf. Sci.
- 1981

### Data-driven spell checking: The synergy of two algorithms for spelling error detection and correction

- Computer ScienceInternational Conference on Advances in ICT for Emerging Regions (ICTer2012)
- 2012

This research attempts to improve the quality of Subasa, an existing n-gram based data driven spell checker using minimum edit distance techniques and to make the system freely available online.

## References

SHOWING 1-10 OF 12 REFERENCES

### An error-correcting parse algorithm

- Computer ScienceCACM
- 1963

It is the author's opinion that those algorithms which do the best job of error recovery are those which are restricted to simpler forms of formal languages.

### The String-to-String Correction Problem

- Mathematics, EducationJACM
- 1974

An algorithm is presented which solves the string-to-string correction problem in time proportional to the product of the lengths of the two strings.

### Algorithm 97: Shortest path

- ChemistryCommun. ACM
- 1962

The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.

### PL/C: the design of a high-performance compiler for PL/I

- Computer ScienceAFIPS '71 (Spring)
- 1971

A general purpose production compiler faces many diverse and demanding tasks and by yielding on some of these requirements, and by sacrificing generality for efficiency for a particular class of program or user, improved compiler performance should be obtainable.

### CORC—the Cornell computing language

- EducationCACM
- 1963

CORC is an experimental computing language that was developed at Cornell University to serve the needs of a large and increasing group of computer users whose demands are both limited and…

### Spelling correction in systems programs

- Computer ScienceCACM
- 1970

By using systems which perform spelling correction, the number of debugging runs per program has been decreased, saving both programmer and machine time.

### Compiler Construction for Digital Computers

- Computer Science
- 1971

The techniques involved in writing compilers for high-level languages such as FORTRAN or PL/1, as well as semantic routines, are described.