By Topic

The application of dynamic programming to connected 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
$33 $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

2 Author(s)
H. F. Silverman ; Div. of Eng., Brown Univ., Providence, RI, USA ; D. P. Morgan

Principles of dynamic programming and its application to discrete-utterance and connected-speech recognition are introduced and discussed. The deterministic form, used for template matching for connected speech, is described in detail, and a number of algorithms are examined. The Viterbi algorithm, which is a form of dynamic programming for a stochastic system, is briefly discussed.<>

Published in:

IEEE ASSP Magazine  (Volume:7 ,  Issue: 3 )