基于词图树扩展的语音命令理解及其容错算法的研究

A Voice Command Understanding and Error Tolerance AlgorithmBased on Word Graph Expansion

本文对计算机语音命令理解的算法作了一些探索性的研究。首先针对词图结构的特点提出了一种词图树扩展理解算法 ,通过分析与实验比较 ,发现该算法在保证精确率的下降很小的条件下可获得比传统的Nbest路径理解算法高得多的召回率 ,而计算效率仅相当于Nbest路径理解算法中句子候选数取值很小时的情况 ;其次根据对实验结果的分析与观察 ,给出了一种行之有效的命令理解容错算法 ,使得理解召回率提高到91 7% ,精确率仍保持在 90 %以上 ,而理解错误率降低了 13 5 % 。

In order to build a more accurate and robust voice command system, a novel Word Graph Expansion algorithm for voice command understanding is presented in this paper.It has been proved by experimental results that this algorithm has a much better performance than the generally adopted N best algorithm while maintaining high computation efficiency. Also an error tolerance method is put forward to improve the robustness of our voice command understanding module,which further decreases the understanding error rate (UER) to 16.6% with the computation efficiency almost unchanged compared with the case without error tolerance.