For example, with our simple tree A B X Y Z if nodes A and B are considered as one elementary tree, with probability P elem (t a |A ⇒ BZ), their collective children will be reordered with probability giving the desired word ordering XZY.
computational complexity as well as data sparsity prevent us from considering arbitrarily large elementary trees, and the number of nodes considered at once still limits the possible alignments.