A Method for the Correction of Garbled Words Based on the Levenshtein Metric
- 1 February 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-25 (2) , 172-178
- https://doi.org/10.1109/tc.1976.5009232
Abstract
In this paper we propose a new method for correcting garbled words based on Levenshtein distance and weighted Levenshtein distance. We can correct not only substitution errors, but also insertion errors and deletion errors by this method. According to the results of simulation on nearly 1000 high occurrence English words, higher error correcting rates can be achieved by this method than any other method tried to date. Hardware realization of the method is possible, though it is rather complicated.Keywords
This publication has 10 references indexed in Scilit:
- A Contextual Postprocessing System for Error Correction Using Binary n-GramsIEEE Transactions on Computers, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972
- Contextual Word Recognition Using Binary DigramsIEEE Transactions on Computers, 1971
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970
- Techniques for replacing characters that are garbled on inputPublished by Association for Computing Machinery (ACM) ,1966
- The degarbler—A program for correcting machine-read morse codeInformation and Control, 1962
- Applied Dynamic ProgrammingPublished by Walter de Gruyter GmbH ,1962
- A program for correcting spelling errorsInformation and Control, 1960
- Articulation Testing MethodsThe Journal of the Acoustical Society of America, 1930
- Relativ Frequency of English Speech SoundsPublished by Harvard University Press ,1923