Fast Approximate String Matching for Chinese Text
Zhiwei Peng · Zhongwen xinxi xuebao · 2004
For now there are two effective methods to improve approximate string matching: bit-vector method and filter method. Since Chinese alphabet has many characters, it needs much computer memory for bit-vector method. This would be a problem for some little computer which has a small memory, such as embedded system. We present a new bit-vector method which needs only about 5% computer memory of original bit-vector method. And, we also utilize the fact that Chinese alphabet is very large and develop a new filter method, BPM-BM, for approximate string matching of Chinese text. It runs at least 14% faster than the known fasted algorithms. In most cases, our algorithm is even 1.5～2 times faster.