首页 | 本学科首页   官方微博 | 高级检索  
     检索      

用于连续语音识别的词汇搜索算法
引用本文:许晓斌,林碧琴,傅秋良,袁保宗.用于连续语音识别的词汇搜索算法[J].北京交通大学学报(自然科学版),1998,22(6):91.
作者姓名:许晓斌  林碧琴  傅秋良  袁保宗
作者单位:北方交通大学电子信息工程学院
摘    要:给出一种用于连续语音识别的词汇树搜索算法.这种方法基于启发搜索,分为音节层—树搜索、词层—树搜索两个过程.为在提高识别速度的同时不牺牲识别率,上述两个过程采用的是“有限宽度树搜索”.在音节层—树搜索中,根据Nbest算法确定允许扩展的有限个音节串.而在词层—树搜索中,根据已得到的允许扩展的音节串确定不同长度的“退回词路径”.这样,每一时刻的最大似然词串可由这些“退回词路径”来确定.这种算法的优点是在搜索不同长度的多音节词的同时,可以减少搜索计算开销和降低对存储空间的需求.

关 键 词:A ̄启发搜索,音节层—树搜索,词层—树搜索,退回词路径

A Lexical Access Strategy for Continuous Speech Recognition
Xu Xiaobin,Lin Biqin,Fu Qiuliang,Yuan Baozong.A Lexical Access Strategy for Continuous Speech Recognition[J].JOURNAL OF BEIJING JIAOTONG UNIVERSITY,1998,22(6):91.
Authors:Xu Xiaobin  Lin Biqin  Fu Qiuliang  Yuan Baozong
Abstract:Presents a lexical tree search strategy for continuous speech recognition. This algorithm is a variant of heuristic search strategy, with two level tree beam search processes which divided into syllable level tree search process and a word level tree search process. The beam search can reduce the necessary of computation without sacrificing the accuracy.In the syllable level search process the admissible syllable sequences are explored using the N best algorithm.And in the word level search process the backtracking word paths are explored from those admissible syllable sequences. Hence, the best current backward word path ending at each node in the word level tree can be determined with these backtracking word paths. This given strategy has the merit of exploring multi syllable words with the reduction of computation and memory necessary.
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号