Other than for dependency parsing, our results have also implications for mildly context-sensitive phrase structure formalisms.
the algorithm of 5 can be adapted to parse a subclass of lexicalized tree-adjoining grammars, improving the result by Eisner and Satta (2000) from O.n 7 / to O.n 6 /.