Large Vocabulary Continuous Speech Recognition - Berlin Chen

TC vs. A* search (2/2)– Operations (time-asynchronous and look-forward)n• Select the most promising hypothesis ( w1;τ )– The best hypotheses with the shortest end time τare extend first» When reaching a word-end state at time t ,incorporate the LM prob. And update the relevantqueue• Pruning atn– The level of partial word sequence hypotheses ( w1;τ )– The level of acoustic word hypotheses ( w n +1;τ ,t)– The level of DP recursion on the tree-internal statehypotheses• TC for LVCSR– Operations (or algorithm) performed in time-synchronous andlook-backward mannerSpeech – Berlin Chen 37