Improving the Multi-Stack Decoding Algorithm in a Segment-based Speech Recognizer

Uloženo v:
Podrobná bibliografie
Název: Improving the Multi-Stack Decoding Algorithm in a Segment-based Speech Recognizer
Autoři: Gábor Gosztolya, András Kocsor
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Zdroj: http://www.inf.u-szeged.hu/~kocsor/publications/Papers/2003/Conf-2003-LNCS-IEA-AIE-GG/Web/GKo03.pdf.
Informace o vydavateli: Springer Verlag
Rok vydání: 2003
Sbírka: CiteSeerX
Popis: During automatic speech recognition selecting the best hypothesis over a combinatorially huge hypothesis space is a very hard task, so selecting fast and efficient heuristics is a reasonable strategy. In this paper a general purpose heuristic, the multi-stack decoding method, was refined in several ways. For comparison, these improved methods were tested along with the well-known Viterbi beam search algorithm on a Hungarian number recognition task where the aim was to minimize the scanned hypothesis elements during the search process. The test showed that our method runs 6 times faster than the basic multi-stack decoding method, and 9 times faster than the Viterbi beam search method.
Druh dokumentu: text
Popis souboru: application/pdf
Jazyk: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.4366
Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.4366
http://www.inf.u-szeged.hu/~kocsor/publications/Papers/2003/Conf-2003-LNCS-IEA-AIE-GG/Web/GKo03.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Přístupové číslo: edsbas.D9C72C2D
Databáze: BASE
Buďte první, kdo okomentuje tento záznam!
Nejprve se musíte přihlásit.