By Topic

Dynamic programming, the viterbi algorithm, and low cost 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)
White, G.M. ; ITT Defense Communications Division, San Diego, California

Dynamic Programming, the Viterbi Algorithm, the theory of finite state machines, and the mathematics of Markov processes are well developed formalisms that can be applied to the problem of pattern matching acoustic events in speech. At the intersection of these formalisms are a set of computationally efficient but powerful algorithms that are a significant improvement over the commonly used pattern matching schemes for handling temporal and spacial deviation from idealized prototypes. This paper will describe some of these relatively new pattern matching algorithms. It will be shown that they reduce to simple forms that promote low cost isolated word and continuous speech recognition.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '78.  (Volume:3 )

Date of Conference:

Apr 1978