【24h】

Optimization of Units for Continuous-Digit Recognition Task

机译:连续数字识别任务的单位优化

获取原文

摘要

The choice of units, sub-word, is generally based on the size of the vocabulary and the maount of training data. In this work, we have introduced new constraints on the units: 1) they should contain sufficient statistics of the features and 2) they should contain sufficient statistics of the vocabulary. This led to minimization of two cost functions, first based o nthe confusion between the features and the units and the second based on the confusion between the units and the words. We minimized first cost function by forming broad phone classes that were less confusing among themselves than the phones. The second cost function was minimized by coding the wond-specific phone sequences. On the continuous digit recgnition task, the broad classes performed worse than the phones. The word-specific phone securences however significantly improved the performance over both the phones and the whole-word units. In this paper we ciscuss the new constraints, our specific implementation of the cost functions, and the corresponding recognition performance.
机译:单位(子词)的选择通常基于词汇的大小和培训数据的基础。在这项工作中,我们对单元引入了新的约束条件:1)它们应包含足够的特征统计信息; 2)它们应包含足够的词汇统计信息。这导致两个成本函数的最小化,第一个基于要素和单元之间的混淆,第二个基于单元和词之间的混淆。我们通过形成广泛的电话类别来最大程度地降低首次成本功能,这些电话类别之间的混乱程度不如电话。通过编码特定于手机的电话序列,第二个成本函数得以最小化。在连续数字识别任务上,普通班级的表现要比电话差。但是,单词专用的电话安全性大大提高了电话和整个单词单元的性能。在本文中,我们讨论了新的约束,成本函数的特定实现以及相应的识别性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号