The structured space of a synchronous grammar is a natural fit for phrase pair probability estimation, though the search space can be prohibitively large.
we explore efficient algorithms for pruning this space that lead to empirically effective results.