A fast vocabulary independent algorithm for spotting words in speech

被引:0
|
作者
Dharanipragada, S [1 ]
Roukos, S [1 ]
机构
[1] IBM Corp, Thomas J Watson Res Ctr, Yorktown Heights, NY 10598 USA
来源
PROCEEDINGS OF THE 1998 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-6 | 1998年
关键词
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
In applications such as audio-indexing, spoken message retrieval and video-browsing, it is necessary to have the ability to detect spoken words that are outside the vocabulary of the speech recognizer used in these systems, in large amounts of speech at speeds many times faster than real-time. In this paper we present a fast, vocabulary independent, algorithm for spotting words in speech. The algorithm consists of a preprocessing stage and a coarse-to-detailed search strategy for spotting a word/phone sequence in speech. The preprocessing method provides a phone-level representation of the speech that can be searched efficiently. The coarse search, consisting of phone-ngram matching, identifies regions of speech as putative word hits. The detailed acoustic match is then conducted only at the putative hits identified in the coarse match. This gives us the desired accuracy and speed in wordspotting. Overall, the algorithm has a speed of execution that is 2400 times faster than real-time.
引用
收藏
页码:233 / 236
页数:4
相关论文
共 50 条
  • [31] Fast Algorithm for Partial Covers in Words
    Tomasz Kociumaka
    Solon P. Pissis
    Jakub Radoszewski
    Wojciech Rytter
    Tomasz Waleń
    Algorithmica, 2015, 73 : 217 - 233
  • [32] Fast Algorithm for Partial Covers in Words
    Kociumaka, Tomasz
    Pissis, Solon P.
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    COMBINATORIAL PATTERN MATCHING, 2013, 7922 : 177 - 188
  • [33] Large Vocabulary Speech Recognition: Speaker Dependent and Speaker Independent
    Hemakumar, G.
    Punitha, P.
    INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, VOL 1, 2015, 339 : 73 - 80
  • [34] HMM based fast keyword spotting algorithm with no garbage models
    Sunil, S
    Palit, S
    Sreenivas, TV
    ICICS - PROCEEDINGS OF 1997 INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING, VOLS 1-3: THEME: TRENDS IN INFORMATION SYSTEMS ENGINEERING AND WIRELESS MULTIMEDIA COMMUNICATIONS, 1997, : 1020 - 1023
  • [35] Improved Neural Bag-of-Words Model to Retrieve Out-of-Vocabulary Words in Speech Recognition
    Sheikh, Imran
    Illina, Irina
    Fohr, Dominique
    Linares, Georges
    17TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION (INTERSPEECH 2016), VOLS 1-5: UNDERSTANDING SPEECH PROCESSING IN HUMANS AND MACHINES, 2016, : 675 - 679
  • [36] Spotting Words in Medieval Manuscripts
    Wahlberg, Fredrik
    Dahllof, Mats
    Martensson, Lasse
    Brun, Anders
    STUDIA NEOPHILOLOGICA, 2014, 86 : 171 - 186
  • [37] A Fast Approximate Acoustic Match for Large Vocabulary Speech Recognition
    Bahl, Lalit R.
    De Gennaro, Steven V.
    Gopalakrishnan, P. S.
    Mercer, Robert L.
    IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, 1993, 1 (01): : 59 - 67
  • [38] New search algorithm for spotting keyword embedded in unconstrained spontaneous speech
    Dai, Lirong
    Wang, Renhua
    1997, (10):
  • [39] Transcription of out-of-vocabulary words in large vocabulary speech recognition based on phoneme-to-grapheme conversion
    Decadt, B
    Duchateau, J
    Daelemans, W
    Wambacq, P
    2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 861 - 864
  • [40] AUTOMATIC DETECTION OF NEW WORDS IN A LARGE VOCABULARY CONTINUOUS SPEECH RECOGNITION SYSTEM
    ASADI, A
    SCHWARTZ, R
    MAKHOUL, J
    SPEECH AND NATURAL LANGUAGE, 1989, : 263 - 265