In this paper, we presented a non-projective dependency parser whose time-complexity of O(n 2 ) improves upon the cubic time implementation of<cite> (McDonald et al., 2005b)</cite> , and does so with little loss in dependency accuracy (.25% to .34%).