Hidden Conditional Random Fields For Speech Recognition
Download Hidden Conditional Random Fields For Speech Recognition PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Hidden Conditional Random Fields For Speech Recognition book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Hidden Conditional Random Fields for Speech Recognition
This thesis investigates using a new graphical model, hidden conditional random fields (HCRFs), for speech recognition. Conditional random fields (CRFs) are discriminative sequence models that have been successfully applied to several tasks in text processing, such as named entity recognition. Recently, there has been increasing interest in applying CRFs to speech recognition due to the similarity between speech and text processing. HCRFs are CRFs augmented with hidden variables that are capable of representing the dynamic changes and variations in speech signals. HCRFs also have the ability to incorporate correlated features from both speech signals and text without making strong independence assumptions among them. This thesis presents my current research on applying HCRFs to speech recognition and HCRFs' potential to replace the current hidden Markov model (HMM) for acoustic modeling. Experimental results of phone classification, phone recognition, and speaker adaptation are presented and discussed. Our monophone HCRFs outperform both maximum mutual information estimation (MMIE) and minimum phone error (MPE) trained HMMs and achieve the-start-of-the-art performance in TIMIT phone classification and recognition tasks. We also show how to jointly train acoustic models and language models in HCRFs, which shows improvement in the results. Maximum a posterior (MAP) and maximum conditional likelihood linear regression (MCLLR) successfully adapt speaker-independent models to speaker-dependent models with a small amount of adaptation data for HCRF speaker adaptation. Finally, we explore adding gender and dialect features for phone recognition, and experimental results are presented.
Hidden Conditional Random Fields for Speech Recognition
This thesis investigates using a new graphical model, hidden conditional random fields (HCRFs), for speech recognition. Conditional random fields (CRFs) are discriminative sequence models that have been successfully applied to several tasks in text processing, such as named entity recognition. Recently, there has been increasing interest in applying CRFs to speech recognition due to the similarity between speech and text processing. HCRFs are CRFs augmented with hidden variables that are capable of representing the dynamic changes and variations in speech signals. HCRFs also have the ability to incorporate correlated features from both speech signals and text without making strong independence assumptions among them. This thesis presents my current research on applying HCRFs to speech recognition and HCRFs' potential to replace the current hidden Markov model (HMM) for acoustic modeling. Experimental results of phone classification, phone recognition, and speaker adaptation are presented and discussed. Our monophone HCRFs outperform both maximum mutual information estimation (MMIE) and minimum phone error (MPE) trained HMMs and achieve the-start-of-the-art performance in TIMIT phone classification and recognition tasks. We also show how to jointly train acoustic models and language models in HCRFs, which shows improvement in the results. Maximum a posterior (MAP) and maximum conditional likelihood linear regression (MCLLR) successfully adapt speaker-independent models to speaker-dependent models with a small amount of adaptation data for HCRF speaker adaptation. Finally, we explore adding gender and dialect features for phone recognition, and experimental results are presented.
Discriminative Learning for Speech Recognition
In this book, we introduce the background and mainstream methods of probabilistic modeling and discriminative parameter optimization for speech recognition. The specific models treated in depth include the widely used exponential-family distributions and the hidden Markov model. A detailed study is presented on unifying the common objective functions for discriminative learning in speech recognition, namely maximum mutual information (MMI), minimum classification error, and minimum phone/word error. The unification is presented, with rigorous mathematical analysis, in a common rational-function form. This common form enables the use of the growth transformation (or extended Baum–Welch) optimization framework in discriminative learning of model parameters. In addition to all the necessary introduction of the background and tutorial material on the subject, we also included technical details on the derivation of the parameter optimization formulas for exponential-family distributions, discrete hidden Markov models (HMMs), and continuous-density HMMs in discriminative learning. Selected experimental results obtained by the authors in firsthand are presented to show that discriminative learning can lead to superior speech recognition performance over conventional parameter learning. Details on major algorithmic implementation issues with practical significance are provided to enable the practitioners to directly reproduce the theory in the earlier part of the book into engineering practice. Table of Contents: Introduction and Background / Statistical Speech Recognition: A Tutorial / Discriminative Learning: A Unified Objective Function / Discriminative Learning Algorithm for Exponential-Family Distributions / Discriminative Learning Algorithm for Hidden Markov Model / Practical Implementation of Discriminative Learning / Selected Experimental Results / Epilogue / Major Symbols Used in the Book and Their Descriptions / Mathematical Notation / Bibliography