... all such subtrees for a hypotheticalT and¯fh1. Fortunately, with a little analysis that ac-counts for ¯fh+1, we can show that at most two sub-trees need to be checked. For a given interruption-free¯fh1, ... constraint for word alignment. Therefore, wepropose a soft version of our cohesion constraint.We perform our interruption check, but we do notinvalidate any hypotheses. Instead, each hypothe-sis ... 72–80,Columbus, Ohio, USA, June 2008.c2008 Association for Computational LinguisticsCohesive Phrase-based Decoding for Statistical Machine TranslationColin Cherry∗Microsoft ResearchOne...