Multiclass composite N-gram language model based on connection direction
✍ Scribed by Hirofumi Yamamoto; Yoshinori Sagisaka
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 530 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0882-1666
- DOI
- 10.1002/scj.1210
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The authors propose a method to generate a compact, highly reliable language model for speech recognition based on the efficient classification of words. In this method, the connectedness with the words immediately before and after the word is taken to represent separate attributes, and individual classification is performed for each word. The resulting composite word class is created separately based on the distribution of words connected before or after. As a result, classification of classes is efficient and reliable. In a multiclass composite N‐gram, which uses the proposed method for the variable‐order N‐gram to bring in chain words, the entry size is reduced to one‐tenth, and the word recognition rate is higher than that of a conventional composite N‐gram for particles or variable‐length word arrays. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(7): 108–114, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1210