作者: T. Kuhn , P. Fetter , A. Kaltenmeier , P. Regel-Brietzmann
DOI: 10.1109/ICASSP.1996.543257
关键词: Word (computer architecture) 、 Speech recognition 、 Path (graph theory) 、 Language model 、 Word error rate 、 Rule-based machine translation 、 Graph theory 、 Speech processing 、 Graph 、 Pruning (morphology) 、 Natural language 、 Computer science
摘要: We present an efficient technique of generating word graphs in a continuous speech recognition system. The graph is constructed two stages. In the first stage, huge generated as by-product beam-driven forward search. Based on dynamic-programming (DP) method, this will be pruned second stage using higher level knowledge, such n-gram language models. pruning edge removed if there no path going through which better scored best-scored graph. proposed evaluated German VERBMOBIL task.