Combined Optimisation of Baseforms and Subword Models for an Hmm Based Speech Recogniser

T. Holter, T. Svendsen
{"title":"Combined Optimisation of Baseforms and Subword Models for an Hmm Based Speech Recogniser","authors":"T. Holter, T. Svendsen","doi":"10.1109/ISSPA.1996.615746","DOIUrl":null,"url":null,"abstract":"In this paper a framework for combined optimisation of baseforms and subword models for a speech recogniser is proposed. Given a set of subword Hidden Markov Models (HMMs) and a set of utterances of a specific word, the modified tree-trellis algorithm and the BaumWelch re-estimation procedure is used iteratively to achieve a combined optimisation of baseforms and subword models. The DARPA Resource Management (RM) database was used to evaluate the combined optimisation scheme. The proposed method resulted in a monotonic increase in the likelihood score of both test- and training data. When compared to the initial lexicon derived from the DARPA RM-distribution and a set of initial HMMs, a 13% reduction in word error rate is achieved at best.","PeriodicalId":359344,"journal":{"name":"Fourth International Symposium on Signal Processing and Its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth International Symposium on Signal Processing and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.1996.615746","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper a framework for combined optimisation of baseforms and subword models for a speech recogniser is proposed. Given a set of subword Hidden Markov Models (HMMs) and a set of utterances of a specific word, the modified tree-trellis algorithm and the BaumWelch re-estimation procedure is used iteratively to achieve a combined optimisation of baseforms and subword models. The DARPA Resource Management (RM) database was used to evaluate the combined optimisation scheme. The proposed method resulted in a monotonic increase in the likelihood score of both test- and training data. When compared to the initial lexicon derived from the DARPA RM-distribution and a set of initial HMMs, a 13% reduction in word error rate is achieved at best.
基于Hmm的语音识别基形和子词模型的组合优化
本文提出了一种用于语音识别的基形和子词模型组合优化的框架。给定一组子词隐马尔可夫模型(hmm)和一组特定词的话语,迭代地使用改进的树格算法和BaumWelch重估计过程来实现基形和子词模型的组合优化。利用DARPA资源管理(RM)数据库对组合优化方案进行评价。所提出的方法导致测试和训练数据的似然分数单调增加。与源自DARPA rm分布的初始词典和一组初始hmm相比,单词错误率最多减少13%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信