A Path-Stack Algorithm for Optimizing Dynamic Regimes in a Statistical Hidden Dynamical Model of Speech

n this paper we report our recent research whose goal is to improve the

performance of a novel speech recognizer based on an underlying statistical

hidden dynamic model of phonetic reduction in the production of conversational

speech. We have developed a path-stack search algorithm which efficiently

computes the likelihood of any observation utterance while optimizing the

dynamic regimes in the speech model. The effectiveness of the algorithm is tested

on the speech data in the Switchboard corpus, in which the optimized dynamic

regimes computed from the algorithm are compared with those from exhaustive

search. We also present speech recognition results on the Switchboard corpus that

demonstrate improvements of the recognizer’s performance compared with the

use of the dynamic regimes heuristically set from the phone segmentation by a

state-of-the-art hidden Markov model (HMM) system.

2000-dengma-csl.pdf
PDF file

In  Computer, Speech and Language. Academic Press

Details

TypeArticle
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > A Path-Stack Algorithm for Optimizing Dynamic Regimes in a Statistical Hidden Dynamical Model of Speech