... Meeting of the Association for Computational Linguistics, pages 115–119,Jeju, Republic of Korea, 8-14 July 2012.c2012 Association for Computational LinguisticsTopic Models for Dynamic Translation ... explicitlysmooth the resulting ps(e|f), since many word pairswill be unseen for a given domain s, we are alreadyperforming an implicit form of smoothing (whencomputing the expected counts), ... a sentence contributes itscounts only to the translation table for the source itcame from, many word pairs will be unobserved for a given table. This sparsity requires smoothing. Sec-ond, we...