DP-based wordgraph pruning
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15206149) , 861-864
- https://doi.org/10.1109/icassp.1996.543257
Abstract
We present an efficient technique of generating word graphs in a continuous speech recognition system. The word graph is constructed in two stages. In the first stage, a huge word graph is generated as a by-product of a beam-driven forward search. Based on a dynamic-programming (DP) method, this huge word graph will be pruned in the second stage using higher level knowledge, such as n-gram language models. In this pruning stage an edge is removed if there is no path going through this edge which is better scored as the best-scored path in the word graph. The proposed technique is evaluated in the German VERBMOBIL task.Keywords
This publication has 2 references indexed in Scilit:
- Word graphs: an efficient interface between continuous-speech recognition and language understandingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Large-vocabulary dictation using SRI's DECIPHER speech recognition system: progressive search techniquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993