首页> 外文会议>Annual conference of the International Speech Communication Association >Hidden Conditional Random Fields with M-to-N Alignments for Grapheme-to-Phoneme Conversion
【24h】

Hidden Conditional Random Fields with M-to-N Alignments for Grapheme-to-Phoneme Conversion

机译:音素到音素转换的具有M到N对齐的隐藏条件随机场

获取原文

摘要

Conditional Random Fields have been successfully applied to a number of NLP tasks like concept tagging, named entity tagging, or grapheme-to-phoneme conversion. When no alignment between source and target side is provided with the training data, it is challenging to build a CRF system with state-of-the-art performance. In this work, we present an approach incorporating an M-to-N alignment as a hidden variable within a transducer-based implementation of CRFs. Including integrated estimation of transition penalties, it was possible to train a state-of-the-art hidden CRF system in reasonable time for an English grapheme-to-phoneme conversion task without using an external model to provide the alignment.
机译:条件随机字段已成功应用于许多NLP任务,例如概念标记,命名实体标记或字素到音素转换。如果训练数据没有在源侧和目标侧之间提供任何对齐,则构建具有最先进性能的CRF系统将具有挑战性。在这项工作中,我们提出了一种方法,该方法在基于换能器的CRF实现中将M到N对齐作为隐藏变量。包括对过渡惩罚的综合估算,有可能在合理的时间内为英语音素到音素的转换任务训练出最先进的隐藏CRF系统,而无需使用外部模型来提供对齐方式。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号