| Abstract | (2005b) formalized dependency parsing as a maximum spanning tree (MST) problem, which can be solved in quadratic time relative to the length of the sentence. |
| Dependency parsing for machine translation | In this section, we review dependency parsing formulated as a maximum spanning tree problem (McDonald et al., 2005b), which can be solved in quadratic time, and then present its adaptation and novel application to phrase-based decoding. |
| Dependency parsing for machine translation | This optimization problem is a known instance of the maximum spanning tree (MST) problem. |
| Dependency parsing for machine translation | Finding the spanning tree y C E rooted at x0 that maximizes s(x,y) as defined in Equation 2 has a straightforward solution in 0(nzlog time for dense graphs such as G, though Tarjan (1977) shows that the problem can be solved in 0(n2). |