Your browser does not support JavaScript!

Start- and end-node segmental-HMM pruning

Start- and end-node segmental-HMM pruning

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

An efficient decoding algorithm for segmental HMMs (SHMMs) is proposed with multi-stage pruning. The generation by SHMMs of a feature trajectory for each state expands the search space and the computational cost of decoding. It is reduced in three ways: pre-cost partitioning, start-node (SN) beam pruning, and conventional end-node (EN) beam pruning. Experiments show that partitioning cuts computation by 20–25% for supervised training, and 40–50% for phone classification, without degradation in recognition accuracy; SN and EN beam pruning together give 80% reduction for embedded recognition on triphone SHMMs, with less than 0.1% degradation.


    1. 1)
    2. 2)
      • Digalakis, V.V.: `Segment-based stochastic models of spectral dynamics for continuous speech recognition', 1992, PhD, Boston University, MA, USA.
    3. 3)
      • Gales, M.J.F., Young, S.J.: `Segmental hidden Markov models', Proc. Eurospeech, Berlin, September 1993, Germany, p. 1579–1582.
    4. 4)
      • Paul, D.: `Algorithms for an optimal A* search and linearizing the search in the stack decoder', Proc. ICASSP, 1991, Toronto, Canada, p. 693–996.
    5. 5)
      • F. Jelinek . A fast sequential decoding algorithm using a stack. IBM J. Res. Dev. , 675 - 685
    6. 6)
    7. 7)
      • S. Young . (2006) The HTK Book (for HTK Version 3.4).

Related content

This is a required field
Please enter a valid email address