While the number of highly non-projective dependency structures is negligible for practical applications (Kuhlmann and Nivre, 2006), the rank cannot easily be bounded.
we present an algorithm that transforms the extracted grammar into a normal form that has rank 2, and thus can be parsed more efficiently.