• DocumentCode
    2392299
  • Title

    Incremental learning mechanisms for speech understanding

  • Author

    Mahood, Willam Lee

  • Author_Institution
    Melpar Div. E-Syst. Inc., Falls Church, VA, USA
  • fYear
    1989
  • fDate
    23-25 Oct 1989
  • Firstpage
    237
  • Lastpage
    243
  • Abstract
    The feasibility of using machine-learning techniques to support the development of a speech understanding system is investigated. The research studies the behavior of hidden Markov models as an incremental learning mechanism. The approach is to train whole-word recognizers using a minimal set of training tokens and then incrementally train them as new examples of the words are recognized and added to the training set. The results show that it is practical to generate seed recognizers from a small training set made up of word tokens composed from segmental fragments. This yields better results than a model formed by chaining hidden Markov models. A seed recognizer can be used to locate additional tokens. One iteration of the Baum-Welch training algorithm is sufficient to incrementally train the hidden Markov model. There is a rapid improvement in the performance of the hidden Markov model with each new token added
  • Keywords
    Markov processes; learning systems; speech analysis and processing; speech recognition; Baum-Welch training algorithm; hidden Markov models; machine-learning techniques; seed recognizers; speech understanding; training tokens; whole-word recognizers; Acoustic noise; Books; Decoding; Hidden Markov models; Learning systems; Pattern recognition; Speech analysis; Speech recognition; Viterbi algorithm; Yarn;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on
  • Conference_Location
    Fairfax, VA
  • Print_ISBN
    0-8186-1984-8
  • Type

    conf

  • DOI
    10.1109/TAI.1989.65326
  • Filename
    65326