Under the ITG constraint, three nodes {A l , A r , A p } are involved when we consider the order o between the two children {A l , A r } in any binary subtrees.
it is natural to define the ITG reordering P(r m ) as a function as follows: where o ∈ {straight, inverted}.