首页> 外文会议>International Conference on Artificial Intelligence IC-AI'2001 Vol.3, Jun 25-28, 2001, Las Vegas, Nevada, USA >A Study on Speech Recognition using New State- Clustering Algorithm of HM-Net with Korean Phonological Rules
【24h】

A Study on Speech Recognition using New State- Clustering Algorithm of HM-Net with Korean Phonological Rules

机译:基于韩国语音规则的HM-Net新状态聚类算法的语音识别研究

获取原文
获取原文并翻译 | 示例

摘要

Recent large vocabulary continuous speech recognition (LVCSR) systems are based on state-clustered hidden Markov models (HMMs). By Successive State Splitting (SSS) algorithm, the Hidden Markov Network (HM-Net), which is an efficient representation of phoneme-context-dependent HMMs, can be generated automatically. SSS is a powerful technique to design topologies of tied-state HMMs, but it doesn't treat unknown contexts in the training phoneme contexts environments adequately. In addition it has some problem in the procedure of the contextual domain. In this paper, we adopt a new state-clustering algorithm of SSS, called Phonetic Decision Tree-based SSS (PDT-SSS), which includes contexts splits based on the Korean phonological rules. This method combines advantages of both the decision tree clustering and SSS, and can generate highly accurate HM-Nets that can express any contexts. Through the Korean phoneme and word recognition experiments, we proved that the new state-clustering algorithm produce belter phoneme and word recognition accuracy than the conventional HMMs.
机译:最近的大型词汇连续语音识别(LVCSR)系统基于状态簇隐马尔可夫模型(HMM)。通过连续状态分割(SSS)算法,可以自动生成隐马尔可夫网络(HM-Net),它是音素上下文相关HMM的有效表示。 SSS是设计绑定状态HMM拓扑的强大技术,但是它不能在训练音素上下文环境中充分处理未知上下文。另外,它在上下文域的过程中存在一些问题。在本文中,我们采用了一种新的SSS状态聚类算法,称为基于语音决策树的SSS(PDT-SSS),该算法包括基于朝鲜语语音规则的上下文分割。这种方法结合了决策树聚类和SSS的优点,并且可以生成可以表达任何上下文的高精度HM-Net。通过韩语音素和单词识别实验,我们证明了新的状态聚类算法比传统的HMM具有更高的音素和单词识别精度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号