A frame-synchronous network search algorithm for connected word recognition
- 1 January 1989
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 37 (11) , 1649-1658
- https://doi.org/10.1109/29.46547
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The graph search machine (GSM): A programmable processor for connected word speech recognition and other applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Partial traceback and dynamic programmingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Automatic recognition of continuously spoken sentences from a finite state grammerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An algorithm for connected word recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A model-based connected-digit recognition system using either hidden Markov models or templatesComputer Speech & Language, 1986
- An introduction to hidden Markov modelsIEEE ASSP Magazine, 1986
- The use of a one-stage dynamic programming algorithm for connected word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Speaker independent connected word recognition using a syntax-directed dynamic programming procedureIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- The DRAGON system--An overviewIEEE Transactions on Acoustics, Speech, and Signal Processing, 1975
- Fast Sequential Decoding Algorithm Using a StackIBM Journal of Research and Development, 1969