| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uo (0) - 4 freq uh (1) - 9 freq o (1) - 56605 freq co (1) - 5195 freq duo (1) - 3 freq uno (1) - 1 freq ko (1) - 7 freq upo (1) - 67 freq vo (1) - 8 freq zo (1) - 5 freq us (1) - 3687 freq io (1) - 7 freq uao (1) - 1 freq uv (1) - 12 freq uw (1) - 6 freq ho (1) - 56 freq up (1) - 13212 freq eo (1) - 6 freq ur (1) - 604 freq -o (1) - 1 freq ux (1) - 3 freq wo (1) - 2 freq so (1) - 4382 freq ud (1) - 4 freq quo (1) - 181 freq |
uo (0) - 4 freq oo (1) - 422 freq uu (1) - 3 freq eo (1) - 6 freq uoa (1) - 1 freq u (1) - 523 freq uy (1) - 4 freq ao (1) - 1 freq yo (1) - 15 freq ua (1) - 3 freq uao (1) - 1 freq ue (1) - 2 freq ui (1) - 6 freq io (1) - 7 freq o (1) - 56605 freq oa (2) - 14 freq aua (2) - 1 freq i (2) - 18870 freq ea (2) - 4 freq oui (2) - 5 freq ae (2) - 5555 freq ye (2) - 20880 freq ioo (2) - 1 freq yoe (2) - 4 freq eu (2) - 126 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 |
UO |
| Time to execute Levenshtein function - 0.487088 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.708652 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.030383 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.039506 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.000846 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. |