Incremental word learning: Efficient HMM initialization and large margin discriminative adaptation

  • Authors:

  • Irene AyllóN Clemente;Martin Heckmann;Britta Wrede

  • Affiliations:

  • Bielefeld University, Research Institute for Cognition and Robotics - CoR-Lab, D-33615 Bielefeld, Germany and Honda Research Institute Europe GmbH, D-63073 Offenbach am Main, Germany;Honda Research Institute Europe GmbH, D-63073 Offenbach am Main, Germany;Bielefeld University, Research Institute for Cognition and Robotics - CoR-Lab, D-33615 Bielefeld, Germany

  • Venue:
  • Speech Communication
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present an incremental word learning system that is able to cope with few training data samples to enable speech acquisition in on-line human robot interaction. As with most automatic speech recognition systems (ASR), our architecture relies on a Hidden Markov Model (HMM) framework where the different word models are sequentially trained and the system has little prior knowledge. To achieve good performance, HMMs depends on the amount of training data, the initialization procedure and the efficiency of the discriminative training algorithms. Thus, we propose different approaches to improve the system. One major problem of using a small amount of training data is over-fitting. Hence we present a novel estimation of the variance floor dependent on the number of available training samples. Next, we propose a bootstrapping approach in order to get a good initialization of the HMM parameters. This method is based on unsupervised training of the parameters and subsequent construction of a new HMM by aligning and merging Viterbi decoded sequences. Finally, we investigate large margin discriminative training techniques to enlarge the generalization performance of the models using several strategies suitable for limited training data. In the evaluation of the results, we examine the contribution of the different stages proposed to the overall system performance. This includes the comparison of different state-of-the-art methods with our presented techniques and the investigation of the possible reduction of the number of training data samples. We compare our algorithms on isolated and continuous digit recognition tasks. To sum up, we show that the proposed algorithms yield significant improvements and are a step towards efficient learning with few examples.