We see that there is a clear tendency for the transition-based parser to have better precision and the graph-based parser better recall.
9 non-projective dependencies are more likely to be correct when they are predicted by the transition-based parser using the swap transition, but real non-projective dependencies are more likely to be found by the graphbased parser using a spanning tree algorithm.