| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| um (0) - 151 freq wum (1) - 1 freq bm (1) - 5 freq ˆm (1) - 2 freq vm (1) - 11 freq ue (1) - 2 freq wm (1) - 12 freq pum (1) - 3 freq uy (1) - 4 freq ›m (1) - 2 freq ym (1) - 2 freq jm (1) - 57 freq ua (1) - 3 freq gum (1) - 19 freq uim (1) - 1 freq cm (1) - 13 freq uo (1) - 4 freq uc (1) - 2 freq uh (1) - 9 freq eum (1) - 1 freq ume (1) - 2 freq tum (1) - 17 freq ux (1) - 3 freq uz (1) - 50 freq m (1) - 847 freq |
um (0) - 151 freq im (1) - 370 freq ym (1) - 2 freq am (1) - 1545 freq uim (1) - 1 freq yum (1) - 22 freq ume (1) - 2 freq eum (1) - 1 freq m (1) - 847 freq om (1) - 6 freq em (1) - 354 freq oim (2) - 14 freq ame (2) - 3 freq ul (2) - 9 freq iim (2) - 2 freq iam (2) - 2 freq my (2) - 2963 freq up (2) - 13212 freq lm (2) - 5 freq kum (2) - 8 freq un (2) - 31 freq dm (2) - 12 freq ub (2) - 3 freq uj (2) - 3 freq rm (2) - 11 freq |
SoundEx code - U500 um - 151 freq uhm - 1 freq 'um - 35 freq uni - 53 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 - 151 freq uhm - 1 freq 'um - 35 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.181600 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.323397 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.027655 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.037363 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.000919 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. |