| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ui (0) - 6 freq si (1) - 43 freq ri (1) - 117 freq uik (1) - 1 freq xi (1) - 13 freq uj (1) - 3 freq pui (1) - 1 freq uf (1) - 1 freq tui (1) - 2 freq uy (1) - 4 freq uid (1) - 1 freq uq (1) - 2 freq vi (1) - 84 freq uu (1) - 3 freq um (1) - 151 freq ti (1) - 4171 freq 'i (1) - 538 freq us (1) - 3687 freq li (1) - 21 freq ub (1) - 3 freq di (1) - 69 freq i (1) - 18870 freq gi (1) - 27 freq fi (1) - 29 freq uh (1) - 9 freq |
ui (0) - 6 freq uu (1) - 3 freq oi (1) - 18 freq yi (1) - 1223 freq ue (1) - 2 freq i (1) - 18870 freq uy (1) - 4 freq ii (1) - 73 freq u (1) - 523 freq oui (1) - 5 freq ei (1) - 102 freq uo (1) - 4 freq ua (1) - 3 freq ai (1) - 30 freq uyii (2) - 1 freq y (2) - 155 freq ayui (2) - 1 freq aiy (2) - 4 freq ye (2) - 20880 freq ey (2) - 141 freq ay (2) - 2481 freq yu (2) - 40 freq ao (2) - 1 freq hui (2) - 1 freq bi (2) - 3287 freq |
SoundEx code - U000 u - 523 freq 'uh - 2 freq uh - 9 freq uhuh - 1 freq °u - 1 freq 'uh-huh' - 1 freq uyah - 2 freq 'ui' - 2 freq uu - 3 freq ¸u - 1 freq ui - 6 freq uhi - 1 freq €˜ui - 1 freq u-y - 1 freq €™u - 2 freq €œuh - 1 freq €˜u - 1 freq uo - 4 freq ua - 3 freq uw - 6 freq uea - 1 freq uyii - 1 freq uoa- - 1 freq uaahu - 1 freq uao - 1 freq ue - 2 freq uy - 4 freq uyh - 1 freq uoa - 1 freq uew - 1 freq uha - 2 freq uyw - 1 freq uuw - 1 freq |
MetaPhone code - U u - 523 freq 'uh - 2 freq uh - 9 freq °u - 1 freq 'ui' - 2 freq uu - 3 freq ¸u - 1 freq ui - 6 freq €˜ui - 1 freq u-y - 1 freq €™u - 2 freq €œuh - 1 freq €˜u - 1 freq uo - 4 freq ua - 3 freq uw - 6 freq uea - 1 freq uoa- - 1 freq uao - 1 freq ue - 2 freq uy - 4 freq uyh - 1 freq uoa - 1 freq uew - 1 freq uyw - 1 freq uuw - 1 freq |
UI |
| Time to execute Levenshtein function - 0.259408 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.396913 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.029178 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.040170 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.000907 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. |