A Bucket Index Scheme for Error Tolerant Chinese Phrase Matching

Abstract

Error tolerant capability is very desirable in designing a Chinese computer input method. It is especially useful in designing an input method based on speech recognition technology because where errors are inevitable. In practical applications, such as natural language speech recognition, we need to handle very large phrase tables. How to do error tolerant phrase matching with very large phrase tables in a real -time speech recognition environment is the problem we are facing. This paper developed an index scheme to help the error tolerant phrase matching calculations with very large phrase tables. The approach is based on three concepts. 1. Cartesian Product File. 2. Covering between buckets. 3.Gradual expansion of search region. The results show that doing multiple error tolerant phrases matching with very large phrase tables in real-time is feasible.