Thanks to the global search over the whole dependency tree the graph-based models realized by MSTParser gain the best performance among the competitors on the English dataset.
the results on the development set indicated that the k-best (k>1) models did not surpass the 1-best one remarkably.