Thus, we define the count of the sequence § in , , as: denotes the number of occurrences of § in the string Ó , i.e., the expected number of occurrences of § given .
we presented several new and efficient algorithms to deal with more general problems related to the construction of language models found in new language processing applications and reported experimental results showing their practicality for constructing very large models.