The basic idea of an SLM is that each w ord would be better predicted from the words that may have a dependency relationship with the wo r d t o b e p r edicted than from the proceeding (n01) words.
the probability P o f a s e n tence w = w 1 w 2 1 1 1 w n and its parse tree T is given as follows: where t i is the i-th partial parse tree sequence.