the universal treebanks that our approach leads to competitive results, while being computationaly very efficient.
computing an optimal solution of this problem is obtained by finding a minimum weight spanning tree.