A parse tree T of sentence x can be factorized into several one-level subtrees, each corresponding to a rule r. In practice, binarization of rules is necessary to obtain cubic parsing time.
the right hand side of each rule should contain no more than 2 states.