| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uh (0) - 8 freq uc (1) - 2 freq um (1) - 142 freq ul (1) - 9 freq uzh (1) - 2 freq 'uh (1) - 2 freq duh (1) - 2 freq uth (1) - 1 freq buh (1) - 3 freq ui (1) - 6 freq ugh (1) - 12 freq nuh (1) - 4 freq ch (1) - 38 freq ih (1) - 81 freq xh (1) - 6 freq uf (1) - 1 freq oh (1) - 1175 freq ut (1) - 9 freq uy (1) - 4 freq uha (1) - 2 freq up (1) - 12983 freq uw (1) - 6 freq yh (1) - 2 freq uj (1) - 3 freq guh (1) - 1 freq |
uh (0) - 8 freq h (1) - 257 freq yh (1) - 2 freq oh (1) - 1175 freq ouh (1) - 1 freq uha (1) - 2 freq uyh (1) - 1 freq uhi (1) - 1 freq ah (1) - 16973 freq eh (1) - 1127 freq ih (1) - 81 freq yuh (1) - 9 freq bh (2) - 13 freq um (2) - 142 freq us (2) - 3606 freq uq (2) - 2 freq hi (2) - 67 freq ch (2) - 38 freq iho (2) - 1 freq he (2) - 25273 freq eeh (2) - 1 freq juh (2) - 1 freq uhj (2) - 2 freq vh (2) - 4 freq wh (2) - 10 freq |
SoundEx code - U000 u - 523 freq 'uh - 2 freq uh - 8 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 - 8 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.195212 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.353422 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.027402 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.036396 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.000790 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. |