To illustrate how TM works, consider the following example: Given the Arabic word ‫,‖من-‬ all possible segmentations are ‫ن(‬ ، ‫)م‬ and ‫.
)من(‬ Given the target words {the, best, man} and the possible mappings for the segments and their probabilities: ‫م‬ ‫ـ‬ = {(m, 0.7), (me, 0.25), (ma, 0.05)} ‫ن‬ = {n, 0.7), (nu, 0.2), (an, 0.1)} ‫من‬ = {(men, 0.4), (man, 0.3), (mn, 0.3)} The only combinations leading valid target words would be: m,an: 0.07), (ma, n: 0.035)} the algorithm would produce the tuple with the highest probability: ‫من(‬ , man, 0.3).