Tree-trellis forward-backward algorithm has been widely used for N-best search in continuous speech recognition. In conventional approaches, the heuristic score used for the A* backward search is derived from the partial-path scores recorded during the forward pass. The inherently delayed use of language model in the lexical tree structure leads to inefficient pruning and the partial-path score...
