m, n, k ∼ P oisson(λ) Given these values, we now draw the appropriate number of stray and abstract morphemes from the corresponding distributions: The sets of morphemes drawn for each language are then ordered: Finally the ordered morphemes are fused into the words that form the parallel phrases: To keep the model as simple as possible, we employ uniform distributions over the sets of orderings and fusings.
given a set of r morphemes (for each language), we define the distribution over permutations of the morphemes to simply be ORDER(•|r) = 1 r!