Based on them, a monolingual parsing model and a tree reordering model are trained to pre-reorder source words into the targetlanguage-like order.
all terminal translation states of the sentence pair {f, e} are disjoint but cover f [0,J+1) and e [0,I+1) at the same time, where J = |f | and I = |e|, and all non-terminal translation states correspond to the partial decoding states generated during decoding.