Advertisement

Dynamic Time Warping

Alias: dynamic programming in speech recognition
  • Alan Bundy
  • Lincoln Wallen
Part of the Symbolic Computation book series (SYMBOLIC)

Abstract

Two programs are provided, one that generates Ipc and autocorrelation coefficients from the speech utterances and the other that, using dynamic programming, compares the test utterance with the reference utterances and finds the best match. The method used is Constrained Endpoint with 2-to-l range of slope.

Keywords

Dynamic Programming Edge Detection Dynamic Time Warping Problem Reduction Speech Utterance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Reference

  1. [Rabiner et al. 78]
    Rabiner, L. R., Rosenberg A. E. and Levinso. S. E. Considerations In Dynamic Time Warping Algorithms for Discrete Word Recognition. IEEE Trans. ASSP 26(6): 575, 1978.MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Alan Bundy
    • 1
  • Lincoln Wallen
  1. 1.Department of Artificial IntelligenceEdinburgh UniversityEdinburghScotland

Personalised recommendations