In , we showed that introducing a model of argument positions into a greedy spanning tree algorithm had little effect on performance.
to consider both directions of competition, we design a new algorithm for constructing (dependency) spanning trees that casts edge selection as a weighted bipartite graph matching (or assignment) problem.