... Association for Computational Linguistics, pages 912–920,Jeju, Republic of Korea, 8-14 July 2012.c2012 Association for Computational LinguisticsA Ranking-based Approach to Word Reordering for Statistical ... thatour approach can bring significant improvements tothe baseline phrase- based SMT system in both pre-ordering and integrated decoding settings.In the rest of the paper, we will first formallypresent ... −1.83, −1.50, −1.20} for {I, am, trying, play} respectively, we can get asorted list {I, play, trying, am}, which is the desiredpermutation according to the target.More formally, for a tree node...