Key points are not available for this paper at this time.
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.>
Silverman et al. (Sun,) studied this question.