... cost of the construction of for allis , where is the n-gram order.Proof. For each and each , there are atmost possible states such that for some ,and . It is trivial to see from the proof of ... exact representation of -gram lan-guage models by WFAs whose size is practical for of ineuse even in tasks with a vocabulary size of about 500,000words and for .Class-based models. In many applications, ... length of is . Hence,the cost of finding all for a given is . Therefore,the total cost is . For all non-empty , we create a new state and for all we set . We create a transition, and for all...