| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| um (0) - 142 freq ur (1) - 541 freq wum (1) - 1 freq jm (1) - 57 freq uhm (1) - 1 freq hum (1) - 44 freq fm (1) - 90 freq uf (1) - 1 freq uu (1) - 3 freq ume (1) - 2 freq mum (1) - 179 freq uc (1) - 2 freq eum (1) - 1 freq un (1) - 31 freq ui (1) - 6 freq up (1) - 12983 freq zm (1) - 1 freq ue (1) - 2 freq mm (1) - 18 freq rum (1) - 32 freq qm (1) - 1 freq ud (1) - 4 freq lm (1) - 5 freq ˆm (1) - 2 freq bm (1) - 5 freq |
um (0) - 142 freq am (1) - 1527 freq ume (1) - 2 freq om (1) - 6 freq im (1) - 370 freq yum (1) - 22 freq ym (1) - 2 freq uim (1) - 1 freq m (1) - 847 freq em (1) - 354 freq eum (1) - 1 freq uy (2) - 4 freq uh (2) - 8 freq eam (2) - 7 freq muu (2) - 2 freq yom (2) - 1 freq tm (2) - 7 freq sm (2) - 4 freq ut (2) - 9 freq ub (2) - 3 freq uv (2) - 12 freq wm (2) - 12 freq us (2) - 3606 freq bum (2) - 43 freq gm (2) - 10 freq |
SoundEx code - U500 um - 142 freq uhm - 1 freq 'um - 27 freq uni - 51 freq un - 31 freq ume - 2 freq umah - 1 freq unn - 5 freq uim - 1 freq une - 4 freq uuno - 1 freq uneo - 1 freq €˜um - 33 freq uon - 1 freq uno - 1 freq unyo - 1 freq umae - 1 freq uiwm - 1 freq uun - 1 freq |
MetaPhone code - UM um - 142 freq uhm - 1 freq 'um - 27 freq ume - 2 freq umah - 1 freq uim - 1 freq €˜um - 33 freq umae - 1 freq uiwm - 1 freq |
UM |
| Time to execute Levenshtein function - 0.184233 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.363679 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027245 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.036930 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000833 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |