Thus, we assume that all phrase pairs have the same probability regardless of their context in a sentence.
our pruning algorithm takes a threshold δ and prunes all phrase pairs that fail to meet the following criteria: The main components of this function is the ratio between the emission from the pruned model and unpruned models given by Pp(t|s) P (t|s) , and the weight given to each s, t pair given by P (s, t).