As an engineering matter, we now make the strong assumption that the unordered dependency trees are similar across languages.
we suppose that different languages use similar underlying syntactic/semantic graphs, but differ in how they realize this graph structure on the surface.