Starting from the leaves of t S , for each node N covering phrase p, we only keep track of the n p s that have the highest reordering probability.
r(N ) ≤ n. There are at most 2n 2 reorderings for any node and only the top-scored n reorderings are recorded.