首页> 外文会议>European signal processing conference;EUSIPCO 2009 >FILLER MODELS FOR AUTOMATIC SPEECH RECOGNITION CREATED FROM HIDDEN MARKOV MODELS USING THE K-MEANS ALGORITHM
【24h】

FILLER MODELS FOR AUTOMATIC SPEECH RECOGNITION CREATED FROM HIDDEN MARKOV MODELS USING THE K-MEANS ALGORITHM

机译:使用K均值算法从隐马尔可夫模型创建自动语音识别的填充器模型

获取原文

摘要

In Automatic Speech Recognition (ASR), the presence of Out Of Vocabulary (OOV) words or sounds, within the speech signal, can have a detrimental effect on recognition performance. One common method of solving this problem is to use filler models to absorb the unwanted OOV utterances. A balance between accepting In Vocabulary (IV) words and rejecting OOV words can be achieved by manipulating the values of Word Insertion Penalty and Filler Insertion Penalty. This paper investigates the ability of three different classes of HMM filler models, K-Means, Mean and Baum-Welch, to discriminate between IV and OOV words. The results show that using the Baum-Welch trained HMMs 97.0% accuracy is possible for keyword IV acceptance and OOV rejection. The K-Means filler models provide the highest IV acceptance score of 97.3% but lower overall accuracy. However, the computational complexity of the K-Means algorithm is significantly lower and requires no additional speech training data.
机译:在自动语音识别(ASR)中,语音信号中存在词汇不足(OOV)单词或声音会对识别性能产生不利影响。解决此问题的一种常用方法是使用填充模型吸收不想要的OOV话语。可以通过操纵“单词插入惩罚”和“填充词插入惩罚”的值来实现接受词汇(IV)单词和拒绝OOV单词之间的平衡。本文研究了三种不同类型的HMM填充模型K-Means,Mean和Baum-Welch区分IV和OOV单词的能力。结果表明,使用Baum-Welch训练的HMM,关键字IV接受和OOV拒绝的准确性为97.0%。 K-Means灌装机型号的IV接受度最高,为97.3%,但总体准确度较低。但是,K-Means算法的计算复杂度要低得多,并且不需要其他语音训练数据。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号