A language model for large-vocabulary speech recognition system is introduced in this paper. The Turing’s probability estimation of n-grams is discussed in detail. The search strategy used in the language model is also described. In the end, some experiment results are presented to show the effectiveness of the estimation and search techniques we have employed.