Even in freer-word order languages such as Czech, almost all non-projective dependency trees are primarily projective, modulo a few nonprojective edges.
if our inference algorithm starts with the highest scoring projective parse, the best non-projective parse only differs by a small number of edge transformations.