A Method for the Correction of Garbled Words Based on the Levenshtein Metric

Authors:
Teruo Okuda;Eiichi Tanaka;Tamotsu Kasai
Affiliations:
Systems Design Section, Systems Development Department, Fujitsu Limited, Kawasaki, Japan.;Department of Electrical Engineering, Faculty of Engineering, University of Osaka Prefecture, Sakai, Japan.;Department of Electrical Engineering, Faculty of Engineering, University of Osaka Prefecture, Sakai, Japan.
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 5
Cited 11

The use of context for correcting garbled English text

ACM '64 Proceedings of the 1964 19th ACM national conference
Contextual Word Recognition Using Binary Digrams

IEEE Transactions on Computers
A Contextual Postprocessing System for Error Correction Using Binary n-Grams

IEEE Transactions on Computers
Techniques for replacing characters that are garbled on input

AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference
Synchronization and substitution error-correcting codes for the Levenshtein metric

IEEE Transactions on Information Theory

Iterative Source/Channel-Decoding Using Reversible Variable Length Codes

DCC '00 Proceedings of the Conference on Data Compression
On Variable Length Codes for Iterative Source/Channel Decoding

DCC '01 Proceedings of the Data Compression Conference
The usability of passphrases for authentication: An empirical field study

International Journal of Human-Computer Studies
Recognition of Spoken Words and Phrases in Multitalker Environment Using Syntactic Methods

IEEE Transactions on Computers
Error-Correcting Parsers for Formal Languages

IEEE Transactions on Computers
Contextual Postprocessing System for Cooperation with a Multiple-Choice Character-Recognition System

IEEE Transactions on Computers
Reliable transfer of variable-length coded correlated date: an low complexity iterative joint source-channel decoding approach

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Using strings for on-line handwriting shape matching: a new weighted edit distance

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
Spelling correction using probabilistic methods

Pattern Recognition Letters
Some experiments in two-dimensional grammatical inference

Pattern Recognition Letters
Towards a more efficient and personalised advertisement content in on-line social networks

Proceedings of the 5th Ph.D. workshop on Information and knowledge

Quantified Score

Hi-index	14.99

Visualization

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.