| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mvd (0) - 1 freq med (1) - 184 freq mv (1) - 2 freq mpd (1) - 1 freq mod (1) - 10 freq vd (1) - 2 freq mwd (1) - 1 freq mnd (1) - 1 freq hvd (1) - 1 freq mad (1) - 356 freq movd (1) - 1 freq mve (1) - 1 freq mkd (1) - 1 freq dvd (1) - 11 freq mvk (1) - 1 freq mid (1) - 60 freq md (1) - 10 freq mud (1) - 35 freq ovd (1) - 3 freq mz (2) - 4 freq mob (2) - 26 freq mah (2) - 379 freq mul (2) - 2 freq mcg (2) - 3 freq mun (2) - 20 freq |
mvd (0) - 1 freq movd (1) - 1 freq mvk (2) - 1 freq mid (2) - 60 freq dvd (2) - 11 freq md (2) - 10 freq mud (2) - 35 freq maved (2) - 1 freq moved (2) - 192 freq muved (2) - 29 freq mkd (2) - 1 freq ovd (2) - 3 freq mod (2) - 10 freq mve (2) - 1 freq mv (2) - 2 freq med (2) - 184 freq vd (2) - 2 freq mpd (2) - 1 freq mad (2) - 356 freq mnd (2) - 1 freq mwd (2) - 1 freq hvd (2) - 1 freq motd (3) - 1 freq meyd (3) - 2 freq maed (3) - 38 freq |
SoundEx code - M130 moved - 192 freq muivit - 7 freq mobbed - 6 freq muived - 22 freq meeved - 22 freq mopped - 3 freq mapped - 4 freq mpd - 1 freq moffat - 27 freq muvit - 5 freq muppet - 11 freq miffed - 4 freq movit - 6 freq muvved - 2 freq muffet - 5 freq moppit - 2 freq movd - 1 freq mufft - 3 freq maved - 1 freq moabite - 1 freq muved - 29 freq meevt - 1 freq moped - 1 freq muffed - 1 freq mbtw - 1 freq mvd - 1 freq |
MetaPhone code - MFT moved - 192 freq muivit - 7 freq might - 421 freq mighty - 41 freq muived - 22 freq meeved - 22 freq moffat - 27 freq muvit - 5 freq 'might - 1 freq mighta - 12 freq miffed - 4 freq movit - 6 freq muvved - 2 freq 'might' - 3 freq muffet - 5 freq myght - 2 freq movd - 1 freq mufft - 3 freq maved - 1 freq muved - 29 freq meevt - 1 freq €˜might - 1 freq mighto - 4 freq muffed - 1 freq moght - 1 freq mvd - 1 freq mghty - 1 freq |
MVD |
| Time to execute Levenshtein function - 0.351033 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.521114 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.028442 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.071639 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.000965 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. |