... of the Association for Computational Linguistics, pages 316–324,Uppsala, Sweden, 11-16 July 2010.c2010 Association for Computational LinguisticsDiscriminative Pruning for Discriminative ... The simplest formulation of ITG contains three types of rules: terminal unary rules /, where and represent words (possibly a null word, ) in the English and foreign language respectively, ... ITG. For instance, there are two parses for three consecutive word pairs, viz. [/ [/ /] ] and [[/ /] /] . The problem of re-dundancy is fixed by adopting ITG normal form....