A fast garbled-spelling correction method based on constituent character hashing
Yasuhiro Takagi, Eiichi Tanaka · Systems and Computers in Japan · 1997
Recently an inverted file method for garbled-spelling correction has been reported. This method requires very large memory, but corrects garbled spelling very fast. In this paper a new method, called the constituent character hashing method, is proposed. This method is based on dividing a dictionary into many small subdictionaries by constituent character hashing. Theoretically speaking, the method has the same error correction ability as the inverted file method. A computer experiment using about 230,000 words shows the following features: 1. The method is faster than the inverted file method for the cases of one or two errors in spelling. 2. The memory requirement of the method is about one-quarter of that of the inverted file method. © 1997 Scripta Technica, Inc. Syst Comp Jpn, 28(7): 21–30, 1997