First, we consider c and m as a single sentence and compute a single bag-of-words representation b cm ∈ R V .
for the translation probabilities, we built a very large phrase table of 160.7 million entries by first filtering out Twitterisms (e.g., long sequences of vowels, hashtags), and then selecting candidate phrase pairs using fisher's exact test (Ritter et al., 2011).