Dynamic programming speech recognition using a context-free grammar
Author:
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 69-72
Abstract
This paper deels with the use of context-free grammars in automatic speech recognition. A dynamic programming algorithm for recognizing and parsing spoken word strings of a context-free grammar is presented. The algorithm can be viewed as a probabilistic extension of the CYK algorithm along with the incorporation of the nonlineer time alignment. Details of the implementation and experimental tests are described.Keywords
This publication has 7 references indexed in Scilit:
- A data-driven organization of the dynamic programming beam search for continuous speech recognition2005
- An efficient word lattice parsing algorithm for continuous speech recognition2005
- An algorithm for connected word recognition2005
- Structural methods in automatic speech recognitionProceedings of the IEEE, 1985
- The use of a one-stage dynamic programming algorithm for connected word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Trainable grammars for speech recognitionThe Journal of the Acoustical Society of America, 1979
- An efficient context-free parsing algorithmCommunications of the ACM, 1970