Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
uhuh (0) - 1 freq huh (1) - 16 freq uhm (2) - 1 freq dhu (2) - 2 freq hoh (2) - 1 freq chuk (2) - 1 freq ehhh (2) - 2 freq hun (2) - 9 freq hrh (2) - 1 freq shue (2) - 2 freq juh (2) - 1 freq huy (2) - 4 freq 'hud (2) - 1 freq huf (2) - 1 freq uha (2) - 2 freq uch (2) - 3 freq gluh (2) - 1 freq 'hush (2) - 2 freq €œhuh (2) - 1 freq hug (2) - 41 freq chug (2) - 2 freq shuch (2) - 3 freq guh (2) - 1 freq 'hum (2) - 2 freq phut (2) - 7 freq |
uhuh (0) - 1 freq huh (1) - 16 freq heh (2) - 41 freq ohh (2) - 3 freq ehh (2) - 1 freq ahh (2) - 9 freq ahah (2) - 1 freq hh (2) - 3 freq hah (2) - 7 freq hoh (2) - 1 freq ohhh (3) - 5 freq hehe (3) - 3 freq hup (3) - 6 freq hhoh (3) - 1 freq rhue (3) - 1 freq huk (3) - 1 freq ouh (3) - 1 freq huv (3) - 1243 freq uyh (3) - 1 freq nuh (3) - 4 freq uydh (3) - 1 freq hkh (3) - 1 freq hugh (3) - 87 freq uhm (3) - 1 freq hyyh (3) - 1 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 - UH uhuh - 1 freq 'uh-huh' - 1 freq uhi - 1 freq uaahu - 1 freq uha - 2 freq |
UHUH |
Time to execute Levenshtein function - 0.404532 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.691690 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.031349 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.039164 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.000941 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. |