The use of speed-up techniques for a speech recognizer system

作     者：Kocsor, Andras Gosztolya, Gabor 

作者机构：Hungarian Acad Sci Res Grp Artificial Intelligence Aradi Vertanuk tere 1 H-6720 Szeged Hungary Univ Szeged H-6720 Szeged Hungary 

出 版 物：《INTERNATIONAL JOURNAL OF SPEECH TECHNOLOGY》 (Int J Speech Technol)

年 卷 期：2006年第9卷第3-4期

页      面：95-107页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Speech recognition Multi-stack decoding algorithm Viterbi beam search Multi-pass search Clustering algorithms Aggregation operators 

摘      要：In speech recognition, not just the accuracy of an automatic speech recognition application is important, but also its speed. However, if we want to create a real-time speech recognizer, this requirement limits the time that is spent on searching for the best hypothesis, which can even affect the recognition accuracy. Thus the applied search method plays an important role in the speech recognition task, and so does its efficiency, i. e. how quickly it finds the uttered words. To speed up this search process, various ideas are available in the literature: we can use search heuristics, multi-pass search, or apply a family of aggregation operators. In this paper we test all these methods in turn, and combine them with a set of other novel speed-up ideas. The test results confirm that all of these techniques are valuable: using combinations of them helped make the speech recognition process over 12 times faster than the basic multi-stack decoding algorithm, and almost 11 times faster than the Viterbi beam search method.