Dynamic programming speech recognition using a context-free grammar

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.