Automatic recognition of keywords in unconstrained speech using hidden Markov models
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 38 (11), 1870-1878
- https://doi.org/10.1109/29.103088
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Speech recognition of a natural text read as isolated wordsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An investigation of the use of dynamic time warping for word spotting and connected speech recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On hidden Markov models in isolated word recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Keyword recognition using template concatenationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- High performance connected digit recognition using hidden Markov modelsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- A frame-synchronous network search algorithm for connected word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Automatic speech recognition of small vocabularies within the context of unconstrained inputThe Journal of the Acoustical Society of America, 1988
- Application of hidden Markov models to automatic speech endpoint detectionComputer Speech & Language, 1987
- Isolated and Connected Word Recognition--Theory and Selected ApplicationsIEEE Transactions on Communications, 1981
- Continuous speech recognition by statistical methodsProceedings of the IEEE, 1976