| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ux (0) - 3 freq uu (1) - 3 freq ud (1) - 4 freq jx (1) - 4 freq cx (1) - 5 freq uh (1) - 9 freq uz (1) - 50 freq px (1) - 1 freq dux (1) - 3 freq uj (1) - 3 freq up (1) - 13212 freq ix (1) - 15 freq gx (1) - 4 freq mx (1) - 6 freq uw (1) - 6 freq ug (1) - 6 freq rx (1) - 6 freq xx (1) - 79 freq vx (1) - 5 freq qx (1) - 1 freq uc (1) - 2 freq tux (1) - 1 freq fux (1) - 1 freq ua (1) - 3 freq ax (1) - 76 freq |
ux (0) - 3 freq x (1) - 544 freq yx (1) - 2 freq ax (1) - 76 freq ix (1) - 15 freq ex (1) - 34 freq ox (1) - 25 freq um (2) - 151 freq ue (2) - 2 freq bx (2) - 4 freq fx (2) - 4 freq ul (2) - 9 freq uo (2) - 4 freq uf (2) - 1 freq hx (2) - 5 freq tx (2) - 3 freq ub (2) - 3 freq sx (2) - 2 freq rux (2) - 1 freq 'x (2) - 2 freq kx (2) - 6 freq ixy (2) - 1 freq exo (2) - 1 freq exe (2) - 2 freq oxo (2) - 1 freq |
SoundEx code - U200 us - 3687 freq use - 466 freq ugh - 12 freq 'use - 2 freq us' - 2 freq uis - 17 freq uise - 281 freq uiss - 132 freq 'us - 3 freq uk - 359 freq uisge - 5 freq uik - 1 freq usa - 52 freq uz - 50 freq ug - 6 freq uzziah - 2 freq 'us' - 4 freq usc - 1 freq uch - 3 freq ukie - 1 freq uk's - 3 freq uize - 14 freq ugie - 1 freq ¾ujsko - 1 freq usy - 1 freq €˜uk - 1 freq uk-eu - 1 freq 'uise - 1 freq €œuse - 2 freq €™us - 1 freq €œus - 1 freq usj - 1 freq uiq - 2 freq uaq - 1 freq uki - 2 freq uku - 1 freq ucia - 1 freq uggs - 2 freq uj - 3 freq uzo - 1 freq uqj - 2 freq uoxqw - 1 freq uq - 2 freq uce - 1 freq ujqzzs - 1 freq uesw - 1 freq uks - 1 freq uhj - 2 freq ux - 3 freq uog - 1 freq uoyxy - 1 freq uc - 2 freq uzh - 2 freq uyji - 1 freq uiox - 1 freq uok - 1 freq uqa - 1 freq 'uk - 1 freq uqay - 1 freq “uisge - 1 freq uaxhu - 1 freq |
MetaPhone code - UKS ukase - 1 freq uk's - 3 freq uggs - 2 freq uks - 1 freq ux - 3 freq uoyxy - 1 freq uiox - 1 freq |
UX |
| Time to execute Levenshtein function - 0.186840 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.317865 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.027215 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.037281 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.000958 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. |