must be balanced against any resulting increase in the computational cost of the parsing algorithm.
recent work in dependency parsing has been restricted to applications of secondorder parsers, the most powerful of which (Carreras, 2007) requires O(n 4 ) time and O(n 3 ) space, while being limited to second-order parts.