Abstract
In speech recognition huge hypothesis spaces are generated. To overcome this problem dynamic programming can be used. In this paper we examine ways of speeding up this search process even more using heuristic search methods, multi-pass search and aggregation operators. The tests showed that these techniques can be applied together, and their combination could significantly speed up the recognition process. The run-times we obtained were 22 times faster than the basic dynamic search method, and 8 times faster than the multi-stack decoding method. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Gosztolya, G., & Kocsor, A. (2005). Speeding up dynamic search methods in speech recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3533 LNAI, pp. 98–100). Springer Verlag. https://doi.org/10.1007/11504894_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
