By Topic

Dynamic programming parsing for context-free grammars in continuous speech recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ney, H. ; Philips GmbH Forschungslab., Hamburg, Germany

The use of context-free grammars in automatic speech recognition is discussed. A dynamic programming algorithm for recognizing and parsing spoken word strings of a context-free grammar is presented. The time alignment is incorporated in to the parsing algorithm. The algorithm performs all functions simultaneously, namely, time alignment, work boundary detection, recognition, and parsing. As a result, no postprocessing is required. From the probabilistic point of view, the algorithm finds the most likely explanation or derivation for the observed input string, which amounts to Viterbi scoring rather than Baum-Welch scoring in the case of regular or finite-state languages. The algorithm provides a closed-form solution. The computational complexity of the algorithm is studied. Details of the implementation and experimental tests are described

Published in:

Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 2 )