A chain VQ clustering algorithm for realtime speech recognition
โ Scribed by Xixian Chen; Changnian Cai
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 472 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper describes a method for the construction of a word graph (or lattice) for large vocabulary, continuous speech recognition. The advantage of a word graph is that a fairly good degree of decoupling between acoustic recognition at the 10-ms level and the final search at the word level using a
Based on the log-normal assumption, parallel model combination (PMC) provides an effective method to adapt the cepstral means and variances of speech models for noisy speech recognition. In addition, the log-add method has been derived to adapt the mean by ignoring the cepstral variance during the p
## Abstract This paper proposes a new method in which the speech recognition processing is executed framewise on the time axis by local parallel operations using the Markov random fields (MRF). There have not been many studies presented concerning the parallel execution of the speech processing. On
Inventory management in supply chain networks involves keeping track of hundreds of items spread across multiple locations with complex interrelationships between them. However, it is not computationally feasible to consider each item individually during the decision making process. The use of clust