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

IEEE Transactions on Computers

Volumn C-25, Issue 2, 1976, Pages 172-178

  Okuda, Teruo ^a   Tanaka, Eiichi ^a   Kasai, Tamotsu ^b  

^a FUJITSU LABORATORIES LTD   (Japan)

^b Osaka Prefecture University   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER RECOGNITION;

SPEECH;

EID: 0016921038     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1976.5009232     Document Type: Article

References (17)

1. H. Fletcher and J.C. Steinberg, “Articulation testing methods,” Bell Syst. Tech. J., vol. 8, pp. 806–854, Oct. 1929.
2. C.K. McElwain and M.E. Evans, “The degarbler-A program for correcting machine read morse code,” Inform. Contr., vol. 5, pp. 368–384, 1962.
3. C.M. Vossler and N.M. Branston, “The use of context for correcting garbled English test,” Proc. Ass. Comput. Mach. 19th Nat. Conf., Aug. 1964, pp. D2. 4-1 to D2. 4–13.
4. G. Carlson, “Techniques for replacing characters that are garbled on input,” in 1966 Spring Joint Computer Conf., AFIPS Conf. Proc., vol. 28. Washington, DC: pp. 189–192, 1966.
5. E. Tanaka, T. Kasai, and M. Fujino, “A correcting method of garbled languages using language information,” Trans. Inst. Elec. Commun. Eng., vol. 54-C, pp. 294–301, Apr. 1971.
6. E.M. Riseman and R.W. Ehrich, “Contextual word recognition using binary diagram,” IEEE Trans. Comput., vol. C-20, pp. 397–403, Apr. 1971.
7. E.M. Riseman and A. Hanson, “A contextual postprocessing system for error correcting using binary n-grams,” IEEE Trans. Comput., vol. C-23, pp. 480–493, May 1974.
8. C.R. Blair, “A program for correcting spelling errors,” Inform. Contr., vol. 3, pp. 60–67, 1960.
9. E. Tanaka and T. Kasai, “A correcting method of garbled languages using ordered key letters,” Trans. Inst. Elec. Commun. Eng. (Japan), vol. 55-D, pp. 363–370, June 1972.
10. V.I. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals,” Sov. Phys.-Dokl., vol. 10, no. 8, pp. 707–710, Feb. 1966.
11. Needlemen and Wunsch, “A general method applicable to the search for similarities in the amino acid sequence of two proteins,” J. Molecular Biology, vol. 48, pp. 443–453, 1970.
12. D. Sankoff, “Matching sequences under deletion/insertion constraints,” Proc. Nat. Acad. Sci., vol. 69, pp. 4–6, 1972.
13. G. Dewey, Relative Frequency of English Speech Sounds. Cambridge, MA: Harvard Univ. Press, 1923.
14. R.E. Bellman and S.E. Dreyfus, Applied Dynamic Programming. Princeton, NJ: Princeton Univ. Press, 1962.
15. E. Tanaka and T. Kasai, “Sync and substitution error-correcting code design based on the Levenshtein metric,” IEEE Trans. Inform. Theory, to be published.
16. T. Okuda, E. Tanaka, and T. Kasai, “An error correcting method based on the extended Hamming metric,” Proc. Joint Meeting of Nagoya Branches of Four Electric Assoc. in Japan, 18a-B-6, Oct. 1972.
17. T. Okuda, E. Tanaka, and T. Kasai, “An extension of a distance concept and its applications,” Rep. Prof. Res. Group on Automata and Languages, Inst., of Electron, and Communication Engineering of Japan, AL72–122, Jan. 1973.