article

Free access

Order-n correction for regular languages

Author:

Robert A. WagnerAuthors Info & Claims

Communications of the ACM, Volume 17, Issue 5

Pages 265 - 268

https://doi.org/10.1145/360980.360995

Published: 01 May 1974 Publication History

PDF eReader

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.

References

[1]

Conway, R.W., and Maxwell, W.L. CORC--the Cornell computing language. Comm. ACM 6, 9 (Sept. 1966), 317-321.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[8]

Gries, D. Compiler Construction Jbr Digital Computers. Wiley, New York, 1971.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[10]

Irons, E.T. An error-correcting parse algorithm. Comm. ACM 13, 11 (Nov. 1963), 669-673.

Digital Library

Google Scholar

[11]

Leinus, R. Error detection and recovery in syntax-directed compilers. Ph.D. Th., U. of Wisconsin, Madison, Wis., 1970.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

Cited By

View all

Gilbert JHajiaghayi MAgrawal KShun J(2023)Brief Announcement: Regular and Dyck Languages in MPCProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591316(113-116)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3558481.3591316
Bloemen Vvan Zelst Svan der Aalst Wvan Dongen Bvan de Pol J(2019)Aligning observed and modelled behaviour by maximizing synchronous moves and using milestonesInformation Systems10.1016/j.is.2019.101456(101456)Online publication date: Oct-2019
https://doi.org/10.1016/j.is.2019.101456
Kari LKonstantinidis SKopecki SYang M(2018)Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via TransducersAlgorithms10.3390/a1111016511:11(165)Online publication date: 23-Oct-2018
https://doi.org/10.3390/a11110165
Show More Cited By

Index Terms

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 Science

In 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

Information & Contributors

Information

Published In

Communications of the ACM Volume 17, Issue 5

May 1974

51 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/360980

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1974

Published in CACM Volume 17, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

120
Total Citations
View Citations
781
Total Downloads

Downloads (Last 12 months)134
Downloads (Last 6 weeks)30

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gilbert JHajiaghayi MAgrawal KShun J(2023)Brief Announcement: Regular and Dyck Languages in MPCProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591316(113-116)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3558481.3591316
Bloemen Vvan Zelst Svan der Aalst Wvan Dongen Bvan de Pol J(2019)Aligning observed and modelled behaviour by maximizing synchronous moves and using milestonesInformation Systems10.1016/j.is.2019.101456(101456)Online publication date: Oct-2019
https://doi.org/10.1016/j.is.2019.101456
Kari LKonstantinidis SKopecki SYang M(2018)Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via TransducersAlgorithms10.3390/a1111016511:11(165)Online publication date: 23-Oct-2018
https://doi.org/10.3390/a11110165
Ko SHan YSalomaa K(2018)Top-down tree edit-distance of regular tree languagesInternational Journal of Advances in Engineering Sciences and Applied Mathematics10.1007/s12572-018-0221-1Online publication date: 11-Jul-2018
https://doi.org/10.1007/s12572-018-0221-1
Jakšić SBartocci EGrosu RNguyen TNiă?Ković D(2018)Quantitative monitoring of STL with edit distanceFormal Methods in System Design10.1007/s10703-018-0319-x53:1(83-112)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s10703-018-0319-x
Bloemen Vvan Zelst Svan der Aalst Wvan Dongen Bvan de Pol J(2018)Maximizing Synchronization for Aligning Observed and Modelled BehaviourBusiness Process Management10.1007/978-3-319-98648-7_14(233-249)Online publication date: 9-Sep-2018
https://dl.acm.org/doi/10.1007/978-3-319-98648-7_14
Mazaheri AShah M(2018)Visual Text CorrectionComputer Vision – ECCV 201810.1007/978-3-030-01261-8_10(159-175)Online publication date: 8-Sep-2018
https://dl.acm.org/doi/10.1007/978-3-030-01261-8_10
Cross JHermansson H(2017)Legislative amendments and informal politics in the European Union: A text reuse approachEuropean Union Politics10.1177/146511651771707118:4(581-602)Online publication date: 17-Jul-2017
https://doi.org/10.1177/1465116517717071
Lagger CLux MMarques O(2017)What Makes People Watch Online VideosComputers in Entertainment10.1145/303470615:2(1-31)Online publication date: 4-Apr-2017
https://dl.acm.org/doi/10.1145/3034706
Korn OBlatz MRees ASchaal JSchwind VGörlich D(2017)Procedural Content Generation for Game Props? A Study on the Effects on User ExperienceComputers in Entertainment 10.1145/297402615:2(1-15)Online publication date: 4-Apr-2017
https://dl.acm.org/doi/10.1145/2974026
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Correcting Counter-Automaton-Recognizable Languages

On the power of quantum finite state automata

Regular Expressions for Languages over Infinite Alphabets

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations