While it seems difficult to improve the asymptotic running time of the Eisner algorithm beyond what is presented in (Eisner and Satta, 1999) ,<cite> McDonald et al. (2005b)</cite> show O(n 2 )-time parsing is possible if trees are not required to be projective.