An algorithm for connected word recognition
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 899-902
- https://doi.org/10.1109/icassp.1982.1171882
Abstract
The principles of an efficient one-pass dynamic programming whole-word pattern matching algorithm for the recognition of spoken sequences of connected words are described. Particular attention is given to the technique for keeping track of word-sequence decisions, which may be constrained by a finite-state syntax. Some extensions of the technique are discussed.Keywords
This publication has 9 references indexed in Scilit:
- LOGOS - A real time hardware continuous speech recognition systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Connected word recognition using a syntax-directed dynamic programming temporal alignment procedurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A level building dynamic time warping algorithm for connected word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- Two-level DP-matching--A dynamic programming-based pattern matching algorithm for connected word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- Minimum prediction residual principle applied to speech recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1975
- The DRAGON system--An overviewIEEE Transactions on Acoustics, Speech, and Signal Processing, 1975
- Real-Time Recognition of Spoken WordsIEEE Transactions on Computers, 1971
- Automatic recognition of 200 wordsInternational Journal of Man-Machine Studies, 1970
- Spoken Digit Recognition Using Time-Frequency Pattern MatchingThe Journal of the Acoustical Society of America, 1960