Progress in dynamic network decoding

Acoustics, Speech and Signal Processing(2014)

引用 3|浏览18
暂无评分
摘要
We show how we boosted the efficiency of the dynamic network decoder in IBM's Attila speech recognition framework, by transforming the underlying concept from token-passing to word-conditioned, and adding speedup methods like sparse LM look-ahead. On several different tasks, we achieve improvements of 30 to 50% in efficiency at equal precision. We compare the efficiency to a state-of-the-art WFST based static decoder, and note that the added methods improve the dynamic decoder under conditions where it was lacking before in comparison, specifically when using a relatively small LM. Overall, the new dynamic decoder performs similarly to the static decoder, with a lead for the dynamic decoder on tasks with a larger LM, and a lead for the static decoder on tasks with a smaller LM.
更多
查看译文
关键词
codecs,network coding,protocols,table lookup,IBM Attila speech recognition framework,WFST based static decoder,dynamic network decoder,dynamic network decoding,language model,sparse LM look-ahead,token-passing,weighted finite state transducers,word-conditioned,Decoding,dynamic,progress,static,token-passing,word conditioned
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要