In this section, we review dependency parsing formulated as a maximum spanning tree problem<cite> (McDonald et al., 2005b)</cite> , which can be solved in quadratic time, and then present its adaptation and novel application to phrase-based decoding.