The final machine is a trigram language model , specifically a Kneser-Ney ( Chen and Goodman , 1998 ) based backoff language model .
an empirical study of smoothing techinques for language modeling
S F Chen J Goodman
The second machine is a dictionary that accepts characters and produces identifiers corresponding to dictionary entries . The final machine is a trigram language model , specifically a Kneser-Ney ( Chen and Goodman , 1998 ) based backoff language model . Differing from ( Lee et al. , 2003 ) , we have also introduced an explicit model for un ` As an example , we do not chain mentions with different gender , number , etc. known words based upon a character unigram model , although this model is dominated by an empirically chosen unknown word penalty .
The final machine is a trigram language model , specifically a Kneser-Ney ( @@CITATION ) based backoff language model .