The Design of an Error Tolerant Chinese Phrase Matching Scheme
碩士 === 國立交通大學 === 資訊科學系 === 87 === 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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/57008803057510964115 |
| Summary: | 碩士 === 國立交通大學 === 資訊科學系 === 87 === 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 thesis 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 phrase matching with very large phrase tables is feasible.
|
|---|