FAST MATCH IS CRITICAL IN STACK DECODING
- An effective underestimated heuristic function for the remaining
portion of speech is very difficult to derive.
- In asynchronous stack decoding, the most expensive step is to extend
the best subpath.
- Fast match is a method for the rapid computation of a list of
candidates that constrain successive search phases.
- Fast match can be regarded as an additional pruning theshold to meet
before a new word or phone can be started.
- A fast match method is called admissible if it never prunes away the
optimal path.
- One popular fast match approach is to estimate the probability
a phone model by using the "straight-thru" path:
