Name
Abstract | ||
|---|---|---|
In this paper, a novel one-pass coarse-to-fine decoding algorithm is proposed to accelerate the speed of Segment Model (SM). The algorithm is originated from the segmentation similarity observation described in the paper and is specific for the SM based speech recognition. At each step, a coarse search is first implemented to get coarse segmentations and then a fine search is performed based on the derived segmentation information. This fast algorithm is successfully integrated into an SM based Mandarin LVCSR system and saves more than 50% decoding time without obvious influence on the recognition accuracy. |
Year | DOI | Venue |
|---|---|---|
2006 | null | 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, Vols 1-13 |
Keywords | Field | DocType |
acceleration,hidden markov models,speech coding,pattern recognition,samarium,speech recognition,decoding,automation | Speech coding,Computer science,Automation,Artificial intelligence,Pattern recognition,Segmentation,Algorithm,Speech recognition,Acceleration,Decoding methods,Hidden Markov model,Vocabulary,Mandarin Chinese | Conference |
Volume | Issue | ISSN |
1 | null | 1520-6149 |
Citations | PageRank | References |
3 | 0.45 | 2 |
Authors | ||
5 | ||