Up to the prior over segmentations (see next), we implement the above model using a weighted version of the binary SCFG as follows: • The weight for lexical rules is given by P (XP → f, e) := P (f | e), where f, e is a phrase-pair.
zero distributions: When a phrase e does not occur in H i , all its pairs f, e in π i will have zero counts.