• DocumentCode
    2233342
  • Title

    HMM based fast keyworld spotting algorithm with no garbage models

  • Author

    Sunil, S. ; Palit, Supriyo ; Sreenivas, T.V.

  • Author_Institution
    CEDT, Indian Inst. of Sci., Bangalore, India
  • fYear
    1997
  • fDate
    9-12 Sep 1997
  • Firstpage
    1020
  • 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
  • Keywords
    hidden Markov models; speech recognition; HMM based wordspotting; carrier sentences; duration modelling; false alarm rate; fast keyworld spotting algorithm; forward search method; garbage models; keyword speech; nonkeyword speech; real-time implementation; rejection rate; scoring method; speaker independent database; speech discrimination; wordspotting applications; Databases; Decoding; Hidden Markov models; Search methods; Speech recognition; Testing; Viterbi algorithm; Vocabulary;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on
  • Print_ISBN
    0-7803-3676-3
  • Type

    conf

  • DOI
    10.1109/ICICS.1997.652135
  • Filename
    652135