Building upon the theoretical work of (Chu and Liu, 1965; Edmonds, 1967) ,<cite> McDonald et al. (2005b)</cite> present a quadratic-time dependency parsing algorithm that is just 0.7% less accurate than "full-fledged" chart parsing (which, in the case of dependency parsing, runs in time O(n 3 ) (Eisner, 1996) ).