article

Free access

A hash code method for detecting and correcting spelling errors

Authors:

M. Mor and

A. S. FraenkelAuthors Info & Claims

Communications of the ACM, Volume 25, Issue 12

Pages 935 - 938

https://doi.org/10.1145/358728.358752

Published: 01 December 1982 Publication History

PDF eReader

Abstract

The most common spelling errors are one extra letter, one missing letter, one wrong letter, or the transposition of two letters. Deletion, exchange, and rotation operators are defined which detect and “mend” such spelling errors and thus permit retrieval despite the errors. These three operators essentially delete a letter of a word, exchange two adjacent letters, and rotate a word cyclically. Moreover, the operators can be used in conjunction with hashing, thus permitting very fast retrieval. Results of experiments run on large databases in Hebrew and in English are briefly indicated.

References

[1]

Bratley, P., and Choueka, Y. Processing terms in document retrieval systems. To appear.

Google Scholar

[2]

Damerau, F.J. A technique for computer detection and correction of spelling errors. Comm. ACM 7, 3 (Mar. 1964), 171-176.

Digital Library

Google Scholar

[3]

Mor, M., and Fraenkel, A.S. Retrieval in an environment of faulty texts or faulty queries. In Proc. 2nd Int. Conf. Databases-- Improving Usability and Responsiveness, Jerusalem, June 1982, Academic Press, New York.

Google Scholar

[4]

Peterson, J.L. Computer programs for detecting and correcting spelling errors. Comm. ACM 23, t2 (Dec. 1980), 676-687.

Digital Library

Google Scholar

[5]

Rosenbaum, W.S., and Hilliard, J.J. Multifont OCR postprocessing system. IBM J. Res. Dev. 19, 4 (July 1975), 398--421.

Digital Library

Google Scholar

[6]

Schmidt, J., and Shamir, E. An improved program for constructing open hash tables. In J.W. de Bakker and J. van Leeuwen (Eds.), 7th Colloquium on Automata, Languages and Programming, July 14-18, 1980, Springer-Verlag, Berlin, pp. 569-581.

Crossref

Google Scholar

[7]

Shiloach, Y. Fast canonization of circular strings. J. of Algorithms 2 (1981) 107-121.

Crossref

Google Scholar

Cited By

View all

Yu GAmizadeh SKim SPagnoni AZhang CChun BWeimer MInterlandi M(2022)WindTunnelProceedings of the VLDB Endowment10.14778/3485450.348545215:1(11-20)Online publication date: 14-Jan-2022
https://dl.acm.org/doi/10.14778/3485450.3485452
Anciaux NBouganim LPucheral PPopa lScerri G(2019)Personal database security and trusted execution environmentsProceedings of the VLDB Endowment10.14778/3352063.335211812:12(1994-1997)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352118
Ge CGao YMiao XChen LJensen CZhu Z(2019)IHCSProceedings of the VLDB Endowment10.14778/3352063.335208812:12(1874-1877)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352088
Show More Cited By

Index Terms

A hash code method for detecting and correcting spelling errors
1. Information systems
  1. Information retrieval
    1. Document representation
      1. Dictionaries
    2. Information retrieval query processing
  2. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
        Hashed file organization

Recommendations

Computer programs for detecting and correcting spelling errors

With the increase in word and text processing computer systems, programs which check and correct spelling will become more and more common. Peterson investigates the basic structure of several such existing programs and their approaches to solving the ...
Read More
A hybrid model for spelling error detection and correction for Urdu language
Abstract
Detecting and correcting misspelled words in a written text are of great importance in many natural language processing applications. Errors can be broadly classified into two groups, namely spelling error and contextual errors. Spelling errors ...
Read More
Correcting Chinese Spelling Errors with Word Lattice Decoding
Special Issue on Chinese Spell Checking

Chinese spell checkers are more difficult to develop because of two language features: 1) there are no word boundaries, and a character may function as a word or a word morpheme; and 2) the Chinese character set contains more than ten thousand ...
Read More

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 25, Issue 12

Dec 1982

84 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/358728

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 December 1982

Published in CACM Volume 25, Issue 12

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

35
Total Citations
View Citations
650
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)2

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yu GAmizadeh SKim SPagnoni AZhang CChun BWeimer MInterlandi M(2022)WindTunnelProceedings of the VLDB Endowment10.14778/3485450.348545215:1(11-20)Online publication date: 14-Jan-2022
https://dl.acm.org/doi/10.14778/3485450.3485452
Anciaux NBouganim LPucheral PPopa lScerri G(2019)Personal database security and trusted execution environmentsProceedings of the VLDB Endowment10.14778/3352063.335211812:12(1994-1997)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352118
Ge CGao YMiao XChen LJensen CZhu Z(2019)IHCSProceedings of the VLDB Endowment10.14778/3352063.335208812:12(1874-1877)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352088
Deutch DMarants EMoskovitch Y(2019)DatalignmentProceedings of the VLDB Endowment10.14778/3352063.335208712:12(1870-1873)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352087
Cao YXiao YXiong LBai LYoshikawa M(2019)PriSTEProceedings of the VLDB Endowment10.14778/3352063.335208612:12(1866-1869)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352086
Xu MWang TDing BZhou JHong CHuang Z(2019)DPSAaSProceedings of the VLDB Endowment10.14778/3352063.335208512:12(1862-1865)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352085
Li ZChen XPan XZou PLi YYu G(2019)SHOALProceedings of the VLDB Endowment10.14778/3352063.335208412:12(1858-1861)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352084
Goldberg SMilo TNovgorodov SRazmadze K(2019)WiCleanProceedings of the VLDB Endowment10.14778/3352063.335208112:12(1846-1849)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352081
Choi HZhu EBangash AMiller R(2019)VISEProceedings of the VLDB Endowment10.14778/3352063.335208012:12(1842-1845)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.14778/3352063.3352080
Rachkovskij D(2019)Index Structures for Fast Similarity Search for Symbol StringsCybernetics and Systems Analysis10.1007/s10559-019-00196-7Online publication date: 18-Oct-2019
https://doi.org/10.1007/s10559-019-00196-7
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Computer programs for detecting and correcting spelling errors

A hybrid model for spelling error detection and correction for Urdu language

Correcting Chinese Spelling Errors with Word Lattice Decoding

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

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations