A comparison of several approximate algorithms for finding multiple (N-best) sentence hypotheses
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 701-704 vol. 1
- https://doi.org/10.1109/icassp.1991.150436
Abstract
The authors introduce a new, more efficient algorithm, the word-dependent N-best algorithm, for finding multiple sentence hypotheses. The proposed algorithm is based on the assumption that the beginning time of a word depends only on the preceding word. The authors compare this algorithm with two other algorithms for finding the N-best hypotheses: the exact sentence-dependent method and a computationally efficient lattice N-best method. Although the word-dependent algorithm is computationally much less expensive than the exact algorithm, it appears to result in the same accuracy. The lattice method, which is still more efficient, has a significantly higher error rate. It is demonstrated that algorithms that use Viterbi scoring have significantly higher error rates than those that use total likelihood scoring.<>Keywords
This publication has 8 references indexed in Scilit:
- Context-dependent modeling for acoustic-phonetic recognition of continuous speechPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The DARPA 1000-word resource management database for continuous speech recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Integrating natural language constraints into HMM-based speech recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Maximum mutual information estimation of HMM parameters for continuous speech recognition using the N-best algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The N-best algorithms: an efficient and exact procedure for finding the N most likely sentence hypothesesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Continuous speech recognition using segmental neural netsPublished by Association for Computational Linguistics (ACL) ,1991
- Integration of diverse recognition methodologies through reevaluation of N-best sentence hypothesesPublished by Association for Computational Linguistics (ACL) ,1991
- A tree-trellis based fast search for finding the N Best sentence hypotheses in continuous speech recognitionPublished by Association for Computational Linguistics (ACL) ,1990