By Topic

On the locality of the forward-backward algorithm [speech recognition]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Merialdo, Bernard ; IBM France Sci. Center, Paris, France

A theorem which shows that the local maximum found by the forward-backward algorithm in the case of discrete hidden Markov models is really local is presented. By this it is meant that this local maximum is restricted to lie in the same connected component of the set {x:P(x)⩾P(x0 )} as the initial point x0 (where P( x) is the polynomial being maximized). This theoretical result suggests that, in practice, the choice of the initial point is important for the quality of the maximum obtained by the algorithm

Published in:

Speech and Audio Processing, IEEE Transactions on  (Volume:1 ,  Issue: 2 )