| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zmpw (0) - 1 freq mpq (2) - 1 freq hmph (2) - 1 freq ypw (2) - 1 freq zjmp (2) - 1 freq mow (2) - 4 freq rvpw (2) - 1 freq gmpe (2) - 1 freq pw (2) - 4 freq nnpw (2) - 1 freq supw (2) - 1 freq mmw (2) - 1 freq zmf (2) - 1 freq mw (2) - 2 freq mew (2) - 2 freq zip (2) - 10 freq smaw (2) - 49 freq mph (2) - 2 freq mps (2) - 31 freq amp (2) - 10 freq czmpf (2) - 1 freq hpw (2) - 1 freq zp (2) - 6 freq imph (2) - 1 freq nmw (2) - 1 freq |
zmpw (0) - 1 freq zppow (3) - 2 freq zma (4) - 1 freq bmw (4) - 4 freq ymp (4) - 2 freq zm (4) - 1 freq zlp (4) - 1 freq imp (4) - 3 freq 'maw (4) - 2 freq maw (4) - 392 freq vmmw (4) - 1 freq zipt (4) - 1 freq zap (4) - 1 freq mp (4) - 39 freq msw (4) - 1 freq hqpw (4) - 1 freq mhw (4) - 1 freq mpd (4) - 1 freq zw (4) - 2 freq imps (4) - 3 freq hmp (4) - 1 freq vmpj (4) - 1 freq rmp (4) - 1 freq mpy (4) - 1 freq mpm (4) - 1 freq |
SoundEx code - Z510 zombie - 12 freq zomb - 1 freq zumba - 2 freq zmpw - 1 freq zjmp - 1 freq znv - 1 freq zmf - 1 freq znaif - 1 freq |
MetaPhone code - SMP sump - 3 freq zmpw - 1 freq suimope - 1 freq |
ZMPW |
| Time to execute Levenshtein function - 0.210497 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.380204 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.028628 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.037657 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.000920 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. |