A = a 1 a 2 ...a n , can be formally described as: where the approximation is based on the assumption that each abbreviation depends only on the corresponding word (we are not considering oneto-many mappings in this study), and a word is dependent on its previous (n − 1) words.
this probability is represented by a traditional n-gram LM.