Malay continuous speech recognition using fast HMM match algorithm
This paper describes the implementation of fast hidden Markov model (HMM) match algorithm in a phoneme-based Malay continuous speech recognition system. The decoding algorithm decouples the computations of state-likelihoods of phone HMM's from the main search which is bounded by syntactical and...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book Section |
| Published: |
Institute of Electrical and Electronics Engineers
2009
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/12940/ http://dx.doi.org/10.1109/ICIEA.2009.5138636 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper describes the implementation of fast hidden Markov model (HMM) match algorithm in a phoneme-based Malay continuous speech recognition system. The decoding algorithm decouples the computations of state-likelihoods of phone HMM's from the main search which is bounded by syntactical and lexical constraints. This avoids the redundant state-likelihood computations of identical phone HMM's for different word models in the tightly integrated search and thus substantially reduce the decoding time. The algorithm is implemented in the framework of one pass dynamic programming search. For a 541-word task, the fast HMM match reduces the real-time factor (RTF) by a factor of 31.8 from 286.45×RT to 9.02×RT, compared to without decoupling. The word accuracy is maintained at 91.6% without loss for a test set perplexity of 15.45 in speaker-dependent mode. |
|---|