Next, we find the model parseḊ i , which is the parse in the forest D i that maximizes the sum of the model score and the loss It should be noted that here we are considering not only the model score, but also the derivation's loss.
there is a large amount of previous research that handles the problem of reordering through the use of improved reordering models for phrase-based SMT , hierarchical phrase-based translation (Chiang, 2007), syntax-based translation (Yamada and Knight, 2001), or preordering (Xia and McCord, 2004).