Linguistic parse trees can provide very useful reordering constraints for SMT.
they are far from perfect because of both parsing errors and the crossing of the constituents and formal phrases extracted from parallel training data.