一种基于假设状态数的改进剪枝方法

Junyao Shao, Gang Liu, Zhiyuan Guo, Baoxiang Li, Yueming Lu
{"title":"一种基于假设状态数的改进剪枝方法","authors":"Junyao Shao, Gang Liu, Zhiyuan Guo, Baoxiang Li, Yueming Lu","doi":"10.1109/ICMEW.2012.106","DOIUrl":null,"url":null,"abstract":"This paper presents an improved pruning method taking into account of the number of states possessed by hypotheses in some certain frames. With conventional pruning strategy, the hypotheses with a low score or a bad ranking will be discarded. However, it neglects a fact that the hypotheses several states ahead of or behind the right hypothesis in the prefix tree, which should be discarded, have similar scores and rankings with the right hypothesis. If a state is part of a partial path hypothesis, we say it is possessed by the hypothesis. So in a speech frame, we can deduce that the hypotheses which possess the most states and the hypotheses which possess the least states have little chance to be the right hypothesis. The proposed method analysis the range of the number of the states possessed by the hypotheses, and discards the hypotheses that possess too many or too few states. According to the experiments, This method could effectively improve the performance of the ASR.","PeriodicalId":385797,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo Workshops","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Pruning Method Based on the Number of States Possessed by Hypotheses\",\"authors\":\"Junyao Shao, Gang Liu, Zhiyuan Guo, Baoxiang Li, Yueming Lu\",\"doi\":\"10.1109/ICMEW.2012.106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an improved pruning method taking into account of the number of states possessed by hypotheses in some certain frames. With conventional pruning strategy, the hypotheses with a low score or a bad ranking will be discarded. However, it neglects a fact that the hypotheses several states ahead of or behind the right hypothesis in the prefix tree, which should be discarded, have similar scores and rankings with the right hypothesis. If a state is part of a partial path hypothesis, we say it is possessed by the hypothesis. So in a speech frame, we can deduce that the hypotheses which possess the most states and the hypotheses which possess the least states have little chance to be the right hypothesis. The proposed method analysis the range of the number of the states possessed by the hypotheses, and discards the hypotheses that possess too many or too few states. According to the experiments, This method could effectively improve the performance of the ASR.\",\"PeriodicalId\":385797,\"journal\":{\"name\":\"2012 IEEE International Conference on Multimedia and Expo Workshops\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Conference on Multimedia and Expo Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMEW.2012.106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Multimedia and Expo Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMEW.2012.106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种改进的剪枝方法,该方法考虑了某些框架中假设所拥有的状态数。在传统的修剪策略下,得分低或排名差的假设将被丢弃。然而,它忽略了一个事实,即在前缀树中正确假设前面或后面几个状态的假设应该被丢弃,它们与正确假设具有相似的分数和排名。如果一个状态是部分路径假设的一部分,我们说它被这个假设所拥有。所以在一个演讲框架中,我们可以推断出拥有最多状态的假设和拥有最少状态的假设都不太可能是正确的假设。该方法分析了假设所拥有的状态数的范围,并抛弃了拥有过多或过少状态的假设。实验结果表明,该方法可以有效地提高ASR的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Improved Pruning Method Based on the Number of States Possessed by Hypotheses
This paper presents an improved pruning method taking into account of the number of states possessed by hypotheses in some certain frames. With conventional pruning strategy, the hypotheses with a low score or a bad ranking will be discarded. However, it neglects a fact that the hypotheses several states ahead of or behind the right hypothesis in the prefix tree, which should be discarded, have similar scores and rankings with the right hypothesis. If a state is part of a partial path hypothesis, we say it is possessed by the hypothesis. So in a speech frame, we can deduce that the hypotheses which possess the most states and the hypotheses which possess the least states have little chance to be the right hypothesis. The proposed method analysis the range of the number of the states possessed by the hypotheses, and discards the hypotheses that possess too many or too few states. According to the experiments, This method could effectively improve the performance of the ASR.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improved Image Retargeting by Distinguishing between Faces in Focus and Out of Focus A Rule-Based Virtual Director Enhancing Group Communication Research Design for Evaluating How to Engage Students with Urban Public Screens in Students' Neighbourhoods Distributed Area of Interest Management for Large-Scale Immersive Video Conferencing Ambient Media for the Third Place in Urban Environments
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1