The only difference is that, for tree linearization, full unordered dependency trees are given as input.
the output word permutations are more constrained (under the projectivity assumption), and more information is available for search disambiguation.