Abstract
In this paper we present a new formulation of the dynamic programming recursive relations both for word and connected word recognition that permits relaxation of boundary conditions imposed on the warping paths, while preserving the optimal character of the dynamic time warping algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L.R. Rabiner, A.E. Rosenberg, S.E. Levinson, “Considerations in Dynamic Time Warping Algorithms for Discrete Word Recognition”, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-26, N° 6, pp. 575–582, December 1978.
J.P. Haton, “Contribution à I′Analyse et à la reconnaissance Automatique de la Parole”, Thèse d’Etat, Universitè de Nancy I, January 1974.
S.K. Das, “Some Experiments in Discrete Utterance Recognition”, Proc. ICASSP, Denver, Co, 1980, pp. 178–181.
A. Waibel, B. Yegnanarayana, “Comparative Study of Nonlinear Time Warping Techniques in Isolated Word Speech Recognition”, Carnegie-Mellon University, Computer Science Department, 1982.
C. Myers, L.R. Rabiner, A.E. Rosenberg, “Performance Tradeoffs in Dynamic Time Warping Algorithms for Isolated Word Recognition”, IEEE Trans. Acoust. Speech, Signal Processing, vol. ASSP-6, N° 6, pp. 623–635, December 1980.
H. Sakoe, S. Chiba, “A Dynamic Programming Approach to Continuous Speech Recognition”, In Proc. Int. Congr. Acoust., Budapest, Hungary, 1971.
H. Sakoe, S. Chiba, “Dynamic Programming Algorithm Optimization for Spoken Word Recognition”, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-26, pp. 43–49, February 1978.
F. Itakura, “Minimum Prediction Residual Principle Applied to Speech Recognition”, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-23, pp. 67–72, February 1975.
J R. Bellman, “Dynamic Programming”, Princeton, N.F. : Princeton, Univ. Press, 1957.
J. di Martino, J.P. Haton, M.C. Haton, “Evaluation d′Algorithmes en Reconnaissance Automatique de la Parole”, In Proc. Int. Congr. Acoust., Paris, France, 1983.
J. di Martino, “Contribution è la Reconnaissance Globale de la Parole : Mots Isolès et Mots Enchaînès”, Dr. Ing. thesis, Université de Nancy I, April 1984.
H. Sakoe, “Two-Level DP-Matching-A Dynamic Programming Based Pattern Matching Algorithm for Connected Word Recognition”, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, pp. 588–595, December 1979.
C.S. Myers, L.R. Rabiner, “A Level Building Dynamic Time Warping Algorithm for Connected Word Recognition”, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, pp. 284–297, April 1981.
J.S. Bridle, M.D. Brown, R.M. Chamberlain, “An Algorithm for Connected Word Recognition”, in Proc. 1982, IEEE International Conference on Acoustics, Speech and Signal Processing, Paris, pp. 899–902, May 1982.
S. Nakagawa, “A Connected Spoken Word Recognition Method by 0(n) Dynamic Programming Pattern Matching Algorithm”, In Proc. 1983, IEEE International Conference on Acoustics, Speech and Signal Processing, Boston, pp. 226–299, April 1983.
H. Ney, “The Use of a One-Stage Dynamic Programming Algorithm for Connected Word Recognition”, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 263–271, April 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
di Martino, J. (1985). Dynamic Time Warping Algorithms for Isolated and Connected Word Recognition. In: De Mori, R., Suen, C.Y. (eds) New Systems and Architectures for Automatic Speech Recognition and Synthesis. NATO ASI Series, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82447-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-82447-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82449-4
Online ISBN: 978-3-642-82447-0
eBook Packages: Springer Book Archive