A*-admissible heuristics for rapid lexical access
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 689-692 vol. 1
- https://doi.org/10.1109/icassp.1991.150433
Abstract
The authors present a new class of A* algorithms for Viterbi phonetic decoding subject to lexical constraints. They show that this type of algorithm can be made to run substantially faster than the Viterbi algorithm in an isolated word recognizer having a vocabulary of 1600 words and that it runs very quickly on a 60000-word recognition task. In addition, multiple recognition hypotheses can be generated on demand and the search can be constrained to respect conditions on phone durations in such a way that computational requirements are substantially reduced.Keywords
This publication has 8 references indexed in Scilit:
- A phonetically labeled acoustic segment (PLAS) approach to speech analysis-synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Continuous speech recognition from a phonetic transcriptionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Using phoneme duration and energy contour information to improve large vocabulary isolated-word recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,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
- The N-Best algorithmPublished by Association for Computational Linguistics (ACL) ,1989
- Principles of Artificial IntelligencePublished by Springer Nature ,1982
- Continuous speech recognition by statistical methodsProceedings of the IEEE, 1976
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATONPublished by Elsevier ,1971