| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uqmdwv (0) - 1 freq qqmw (3) - 1 freq kqmv (3) - 1 freq uqwvr (3) - 1 freq bqdv (3) - 1 freq mqvrwv (3) - 1 freq jmwv (3) - 1 freq uqwve (3) - 1 freq wqcv (4) - 1 freq ywv (4) - 1 freq rmov (4) - 1 freq sumdy (4) - 62 freq oqmdhtl (4) - 1 freq mwd (4) - 1 freq qzv (4) - 1 freq qzw (4) - 1 freq mows (4) - 1 freq uimor (4) - 1 freq wqw (4) - 1 freq uqngch (4) - 1 freq uoxqw (4) - 1 freq mew (4) - 2 freq mawk (4) - 1 freq uimour (4) - 3 freq unmade (4) - 5 freq |
uqmdwv (0) - 1 freq jmwv (5) - 1 freq uqwve (5) - 1 freq qqmw (6) - 1 freq uqwvr (6) - 1 freq kqmv (6) - 1 freq bqdv (6) - 1 freq mqvrwv (6) - 1 freq maw (7) - 392 freq hmv (7) - 2 freq amdee (7) - 1 freq oqm (7) - 1 freq qm (7) - 1 freq qyfws (7) - 1 freq smaw (7) - 49 freq mowd (7) - 2 freq emdy (7) - 4 freq sumdys (7) - 1 freq qjvv (7) - 1 freq qrw (7) - 2 freq handw (7) - 1 freq gmdnc (7) - 1 freq debdev (7) - 1 freq zmpw (7) - 1 freq qmj (7) - 1 freq |
SoundEx code - U253 uqmdwv - 1 freq uyeasound - 1 freq |
MetaPhone code - UKMTF uqmdwv - 1 freq |
UQMDWV |
| Time to execute Levenshtein function - 0.182380 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.371735 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.028024 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.038172 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.000871 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. |