Zobrazit v EDS

Speeding Up Dynamic Search Methods in Speech Recognition.

Uloženo v:

Podrobná bibliografie
Název:	Speeding Up Dynamic Search Methods in Speech Recognition.
Autoři:	Ali, Moonis, Esposito, Floriana, Gosztolya, Gábor¹, Kocsor, András¹
Zdroj:	Innovations in Applied Artificial Intelligence. 2005, p98-100. 3p.
Abstrakt:	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. [ABSTRACT FROM AUTHOR]
Databáze:	Supplemental Index

Popis
Abstrakt:	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. [ABSTRACT FROM AUTHOR]
ISBN:	9783540265511
DOI:	10.1007/11504894_16