About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE Transactions on Acoustics, Speech, and Signal Processing
Paper
Memory and Time Improvements in a Dynamic Programming Algorithm for Matching Speech Patterns
Abstract
Recently, dynamic programming has been found useful for performing nonlinear time warping in speech recognition. Although considerably faster than exhaustive search procedures, the dynamic programming procedure nevertheless requires substantial computation. Also, considerable storage is normally required for reference prototypes necessary in the matching process. This paper is concerned with methods for reducing this storage and computation. Empirical results indicate that one method yields 50 to 60 percent storage reduction and a factor of 4 to 6 in computational savings relative to conventional dynamic programming procedures without degradation in recognition accuracy. © 1978 IEEE