BravoBrava
Mississippi State University
•
Dynamic programming is used
to find the most
probable path
through the network.
•
Beam search is used to
control resources.
Implementation Issues
Dynamic Programming- Based Search
•
Search is time synchronous
and left-to-right.
•
Arbitrary amounts of silence
must be permitted between
each word.
•
Words are hypothesized
many times
with different
start/ stop times, which
significantly increases
search complexity.