作者: Teruo Okuda , Eiichi Tanaka , Tamotsu Kasai
关键词:
摘要: In this paper we propose a new method for correcting garbled words based on Levenshtein distance and weighted distance. We can correct not only substitution errors, but also insertion errors deletion by method. According to the results of simulation nearly 1000 high occurrence English words, higher error rates be achieved than any other tried date. Hardware realization is possible, though it rather complicated.