From the directed graph A, a Minimum Spanning Tree (MST) is constructed, using Chu-Liu-Edmonds algorithm (Chu & Liu, 1965;Edmonds, 1967) where the weight of each edge is 1/|V|.
we computed the tree that covers all the sentence and whose dependency relations are discovered simultaneously by as many of the individual parsers as possible (i.e.