's r, however, tsim is token-based, incorporating word frequency.
the intersection of two bags (rather than sets) of tokens contains the minimum count (over the intersected bags) of each type; the union contains the maximum counts, e.g., With the assumption of equiprobability, any translation lexicon (or, importantly, union thereof) containing a set of word-to-word entries, can be used in computing tsim.