| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uh (0) - 9 freq 'uh (1) - 2 freq bh (1) - 13 freq uw (1) - 6 freq mh (1) - 3 freq uy (1) - 4 freq fh (1) - 4 freq ouh (1) - 1 freq ah (1) - 17377 freq uo (1) - 4 freq uz (1) - 50 freq ue (1) - 2 freq xh (1) - 6 freq ub (1) - 3 freq uj (1) - 3 freq up (1) - 13212 freq ut (1) - 9 freq vh (1) - 4 freq eh (1) - 1202 freq rh (1) - 1 freq uhj (1) - 2 freq zh (1) - 1 freq buh (1) - 3 freq uu (1) - 3 freq ui (1) - 6 freq |
uh (0) - 9 freq oh (1) - 1188 freq yh (1) - 2 freq uyh (1) - 1 freq eh (1) - 1202 freq h (1) - 258 freq uha (1) - 2 freq yuh (1) - 9 freq ih (1) - 81 freq ouh (1) - 1 freq ah (1) - 17377 freq uhi (1) - 1 freq uch (2) - 3 freq guh (2) - 1 freq huh (2) - 16 freq nuh (2) - 4 freq uv (2) - 12 freq huy (2) - 4 freq ugh (2) - 12 freq ph (2) - 53 freq ug (2) - 6 freq uth (2) - 1 freq dh (2) - 1 freq duh (2) - 2 freq kh (2) - 5 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 |
UH |
| Time to execute Levenshtein function - 0.366326 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.697151 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.028512 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.086962 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.000902 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. |