... pro-vide state -of- the-art performance across multiplelanguages. However, the parsing algorithms re-quire that the score of a dependency tree factorsas a sum of the scores of its edges. This ... parsing algorithm. of dependents have been gathered. T his allows forthe collection of pairs of adjacent dependents ina single stage, which allows for the incorporation of second-order scores, ... score of a dependency treeto be the sum of edge scores,s(x, y) =(i,j)∈ys(i, j)where x = x1· · · xnis an input sentence and ya dependency tree for x. We can view y as a set of tree...