As pointed out by Gildea and Temperley (2007), however, finding the unconstrained minimal-length linearization is a well-studied problem with an O(n 1.6 ) solution (Chung, 1984).
this approach does not take into account constraints of projectivity or mild context-sensitivity.