HMM based fast keyworld spotting algorithm with no garbage models

S. Sunil, Supriyo Palit, T. Sreenivas
{"title":"HMM based fast keyworld spotting algorithm with no garbage models","authors":"S. Sunil, Supriyo Palit, T. Sreenivas","doi":"10.1109/ICICS.1997.652135","DOIUrl":null,"url":null,"abstract":"The problem of discriminating keyword and non-keyword speech which is important in wordspotting applications is addressed. We have shown that garbage models cannot reduce both the rejection and false alarm rates simultaneously. To achieve this we have proposed a new scoring and search method for HMM based wordspotting without garbage models. This is a simple forward search method which incorporates the duration modelling of the keyword for efficient discrimination of keyword and non-keyword speech. This method is computationally fast, which makes it suitable for real-time implementation. The results are reported on a speaker independent database containing 10 keywords embedded in 150 carrier sentences.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"64 1","pages":"1020-1023 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息通信技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/ICICS.1997.652135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The problem of discriminating keyword and non-keyword speech which is important in wordspotting applications is addressed. We have shown that garbage models cannot reduce both the rejection and false alarm rates simultaneously. To achieve this we have proposed a new scoring and search method for HMM based wordspotting without garbage models. This is a simple forward search method which incorporates the duration modelling of the keyword for efficient discrimination of keyword and non-keyword speech. This method is computationally fast, which makes it suitable for real-time implementation. The results are reported on a speaker independent database containing 10 keywords embedded in 150 carrier sentences.
基于HMM的无垃圾模型键世界快速识别算法
解决了单词识别应用中关键字和非关键字语音的区分问题。我们已经证明,垃圾模型不能同时降低拒绝率和虚警率。为了实现这一目标,我们提出了一种新的基于HMM的不含垃圾模型的词点评分和搜索方法。这是一种简单的前向搜索方法,它结合了关键字的持续时间建模,可以有效地区分关键字和非关键字语音。该方法计算速度快,适合于实时实现。结果报告在一个独立于说话人的数据库中,该数据库包含10个关键词,嵌入在150个载体句中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
1369
期刊介绍:
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信