Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
umes (0) - 1 freq cumes (1) - 1 freq uses (1) - 47 freq fumes (1) - 11 freq lumes (1) - 2 freq ume (1) - 2 freq mes (1) - 3 freq amos (2) - 3 freq mum's (2) - 14 freq uiss (2) - 130 freq gaes (2) - 173 freq mesa (2) - 2 freq ruses (2) - 1 freq uizes (2) - 7 freq byes (2) - 3 freq pmqs (2) - 2 freq foes (2) - 10 freq uk's (2) - 3 freq bums (2) - 8 freq hums (2) - 3 freq lume (2) - 1 freq yies (2) - 21 freq hms (2) - 8 freq mps (2) - 31 freq eyes (2) - 612 freq |
umes (0) - 1 freq mes (1) - 3 freq aums (2) - 1 freq mos (2) - 9 freq ems (2) - 4 freq amys (2) - 1 freq maes (2) - 7 freq mus (2) - 1 freq ms (2) - 29 freq emus (2) - 1 freq mesa (2) - 2 freq mis (2) - 3 freq fumes (2) - 11 freq uses (2) - 47 freq cumes (2) - 1 freq lumes (2) - 2 freq ume (2) - 2 freq mas (2) - 7 freq amos (2) - 3 freq yums (2) - 3 freq vmas (3) - 1 freq mer (3) - 8 freq fees (3) - 13 freq omen (3) - 5 freq eme (3) - 1 freq |
SoundEx code - U520 unco - 325 freq unca - 12 freq unique - 52 freq uneasy - 18 freq umes - 1 freq unis - 3 freq unease - 6 freq 'unco - 2 freq unce - 7 freq unhook - 1 freq unesco - 9 freq un's - 1 freq 'unesco - 3 freq unwise - 1 freq unk - 1 freq -ung - 1 freq uneco - 2 freq unich - 1 freq €œunco - 1 freq €™uang - 2 freq umwyys - 1 freq ung - 1 freq unsee - 1 freq |
MetaPhone code - UMS umes - 1 freq umwyys - 1 freq |
UMES |
Time to execute Levenshtein function - 0.241910 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.552940 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.028826 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.073201 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.000856 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. |