Automatic generation of non-uniform context-dependent HMM topologies based on the MDL criterion
نویسندگان
چکیده
We propose a new method of automatically creating nonuniform context-dependent HMM topologies by using the Minimum Description Length (MDL) criterion. Phonetic decision tree clustering is widely used, based on the Maximum Likelihood (ML) criterion, and creates only contextual variations. However, it also needs to empirically predetermine control parameters for use as stop criteria, for example, the total number of states. Furthermore, it cannot create topologies with various state lengths automatically. Therefore, we introduce the MDL criterion as split and stop criteria, and use the Successive State Splitting (SSS) algorithm as a method of generating contextual and temporal variations. This proposed method, the MDL-SSS, can automatically create proper topologies without such predetermined parameters. Experimental results show that the MDLSSS can automatically stop splitting and obtain more appropriate HMM topologies than the original one. Furthermore, we investigated the MDL-SSS combined with phonetic decision tree clustering, and this method can automatically obtain the best performance with any heuristic.
منابع مشابه
Automatic Generation of Non-uniform and Context-Dependent HMMs Based on the Variational Bayesian Approach
We propose a new method both for automatically creating non-uniform, context-dependent HMM topologies, and selecting the number of mixture components based on the Variational Bayesian (VB) approach. Although the Maximum Likelihood (ML) criterion is generally used to create HMM topologies, it has an over-fitting problem. Recently, to avoid this problem, the VB approach has been applied to create...
متن کاملA Successive State Splitting Algorithm Based on the Mdl Criterion by Data-driven and Decision Tree Clustering
We propose a new Successive State Splitting (SSS) algorithm based on the Minimum Description Length (MDL) criterion to design tied-state HMM topologies automatically. The SSS algorithm is a mechanism for creating both temporal and contextual variations based on the Maximum Likelihood (ML) criterion. However, it also needs to empirically predetermine control parameters for use as stop criteria, ...
متن کاملIncreasing the mixture components of non-uniform HMM structures based on a variational Bayesian approach
We propose using the Variational Bayesian (VB) approach for automatically creating non-uniform, context-dependent HMM topologies. Although the Maximum Likelihood (ML) criterion is generally used to create HMM topologies, it has an overfitting problem. Recently, to avoid this problem, the VB approach has been applied to create acoustic models for speech recognition. We introduce the VB approach ...
متن کاملCross-Validation and Minimum Generation Error based Decision Tree Pruning for HMM-based Speech Synthesis
This paper presents a decision tree pruning method for the model clustering of HMM-based parametric speech synthesis by cross-validation (CV) under the minimum generation error (MGE) criterion. Decision-tree-based model clustering is an important component in the training process of an HMM based speech synthesis system. Conventionally, the maximum likelihood (ML) criterion is employed to choose...
متن کاملBayesian context clustering using cross valid prior distribution for HMM-based speech recognition
Decision tree based context clustering [Young; '94] ・ Construct a parameter tying structure ・ Can estimate robust parameter ・ Can generate unseen context dependent models ・ Minimum description length (MDL) criterion [Shinoda; '97] Bayesian approach ・ Variational Bayesian (VB) method [Attias; '99] ⇒ Applied to speech recognition [Watanabe; '04] ・ Can use prior information ⇒ Affect context cluste...
متن کامل