We then pass over this mixed corpus, and for each word w, if {w | w, w ∈ R ∼ } is non-empty and of cardinality k, i.e., w is in the seed list of equivalences, we replace w with w with probability 1/2k.
we flip a coin whether to replace w, and then randomly choose one of its equivalences as our replacement.