The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Dynamic programming algorithm optimization for spoken word recognition
Abstract
This paper reports on an optimum dynamic progxamming (DP) based time-normalization algorithm for spoken word recognition. First, a general principle of time-normalization is given using time-warping function. Then, two time-normalized distance definitions, called symmetric and asymmetric forms, are derived from the principle. These two forms are compared with each other through theoretical discussions and experimental studies. The symmetric form algorithm superiority is established. A new technique, called slope constraint, is successfully introduced, in which the warping function slope is restricted so as to improve discrimination between words in different categories. The effective slope constraint characteristic is qualitatively analyzed, and the optimum slope constraint condition is determined through experiments. The optimized algorithm is then extensively subjected to experimental comparison with various DP-algorithms, previously applied to spoken word recognition by different research groups. The experiment shows that the present algorithm gives no more than about two-thirds errors, even compared to the best conventional algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This is based on the DTW algorithm [54], which can identify stretching and compression in time series without a negative influence on the resulting similarity values.”
From Case-Based Data Quality Management for IoT Logs: A Case Study Focusing on Detection of Data Quality Issues (2025) · cites this paper as [54]
Citations
Cites
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
Bellman, R. E., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 1,971
Minimum prediction residual principle applied to speech recognition
Itakura, F. (1975) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1975.1162641 · Cited by 1,627
A Dynamic Programming Approach to Continuous Speech Recognition
Sakoe, H., & Chiba, S. (1971) · Cited by 358
Automatic recognition of 200 words
Velichko, V. M., & Zagoruyko, N. G. (1970) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(70)80008-6 · Cited by 225
Speech recognition experiments with linear predication, bandpass filtering, and dynamic programming
White, G., & Neely, R. (1976) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1976.1162779 · Cited by 158
Research works printed but not linked: 3
- sakoe, 1973, Comparative study of DP-pattern matching techniques for speech recognition, 1973 Tech Group Meeting Speech Acoust Soc Japan
- tsuruta, 1974, Real-time speech recognition system by minicomputer with DP processor, 1974 Tech Group Meeting Speech Acoust Soc Japan
- sakoe, 1970, A similarity evaluation of speech patterns by dynamic programming, Dig 1970 Nat Meeting Inst Electron Comm Eng, 136
Cited by
Davis, S., & Mermelstein, P. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163420 · Cited by 5,465
Recurrence plots for the analysis of complex systems
MARWAN, N., CARMENROMANO, M., THIEL, M., & KURTHS, J. (2007) · Physics Reports · doi:10.1016/j.physrep.2006.11.001 · Cited by 3,814
“The purpose was to match or align two sequences [83,84].”
BackgroundExact indexing of dynamic time warping
Keogh, E., & Ratanamahatana, C. A. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-004-0154-9 · Cited by 1,962
Toward accurate dynamic time warping in linear time and space
Salvador, S., & Chan, P. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11508 · Cited by 1,705
EXPERT SYSTEMS WITH APPLICATIONS
(2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.10.010 · Cited by 1,656
Metadata
- Authors
- Sakoe, H., & Chiba, S.
- Affiliations
- NEC (Japan) (JP)
- Venue
- IEEE Transactions on Acoustics Speech and Signal Processing
- Published
- 1978-02
- Volume
- 26
- Issue
- 1
- Pages
- 43-49
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2128160875
- Cited by
- 6,727
- References
- 6
- Citations by year
- 2026: 442 · 2025: 438 · 2024: 369 · 2023: 403 · 2022: 339 · 2021: 393 · 2020: 392 · 2019: 338 · 2018: 293 · 2017: 294 · 2016: 309 · 2015: 288 · 2014: 263 · 2013: 269 · 2012: 247
- FWCI
- 12.48
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Acoustics Speech and Signal Processing (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Speech Recognition and Synthesis
- Physical Sciences › Computer Science › Signal Processing › Speech and Audio Processing
- Social Sciences › Psychology › Experimental and Cognitive Psychology › Phonetics and Phonology Research
- Keywords
- spoken word recognition, dynamic programming, time normalization, time warping, slope constraints, word discrimination, speech recognition algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.