A Efficient Tree-Trellis N-best Algorithm And Its Application In Chinese Speech Recognition Abstract N-best search is of vital importance in large vocabulary continuous speech recognition. This paper first gives a deep insight of the traditional N-best search algorithm, such as parallel algorithm, sequential algorithm and Tree-Trellis algorithm, and point out the efficiency of Tree-Trellis algorithm, then gives out a more efficient method based on Tree-Trellis algorithm, finally gives out N best path efficiently. keywords: A* algorithm N-best Tree-Trellis