| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uvms (0) - 1 freq uvs (1) - 1 freq rims (2) - 3 freq homs (2) - 1 freq ulls (2) - 1 freq us (2) - 3687 freq moms (2) - 2 freq rams (2) - 6 freq arms (2) - 67 freq cims (2) - 1 freq nims (2) - 2 freq um (2) - 151 freq ems (2) - 4 freq cams (2) - 54 freq uses (2) - 47 freq rvus (2) - 1 freq uk's (2) - 3 freq ovme (2) - 1 freq vzs (2) - 1 freq hms (2) - 8 freq uks (2) - 1 freq v's (2) - 1 freq vs (2) - 22 freq nms (2) - 2 freq lumms (2) - 1 freq |
uvms (0) - 1 freq vmas (2) - 1 freq uvs (2) - 1 freq erms (3) - 48 freq tams (3) - 4 freq kms (3) - 1 freq poms (3) - 1 freq doms (3) - 3 freq hems (3) - 8 freq hams (3) - 10 freq jams (3) - 3 freq pms (3) - 7 freq alms (3) - 2 freq mums (3) - 11 freq vbs (3) - 1 freq dims (3) - 3 freq avs (3) - 1 freq emms (3) - 1 freq lms (3) - 1 freq gums (3) - 16 freq lims (3) - 2 freq dems (3) - 6 freq toms (3) - 1 freq kums (3) - 5 freq lums (3) - 34 freq |
SoundEx code - U152 upmak - 6 freq upmakkin - 1 freq upmakkit - 3 freq upmaist - 1 freq up-an-comers - 1 freq uppance - 1 freq ufonyz - 1 freq uvms - 1 freq uwbamx - 1 freq uafneucpjo - 1 freq |
MetaPhone code - UFMS uvms - 1 freq |
UVMS |
| Time to execute Levenshtein function - 0.214264 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.341189 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.029073 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.038464 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.000867 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. |