| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| movd (0) - 1 freq ovd (1) - 3 freq movs (1) - 2 freq moved (1) - 192 freq mowd (1) - 2 freq mod (1) - 10 freq mvd (1) - 1 freq mov (1) - 3 freq motd (1) - 1 freq mood (1) - 82 freq mond (1) - 4 freq move (1) - 314 freq mold (1) - 2 freq moped (2) - 1 freq maid (2) - 94 freq moka (2) - 1 freq doud (2) - 1 freq moch (2) - 8 freq rowd (2) - 1 freq ond (2) - 1 freq goud (2) - 3 freq vovr (2) - 1 freq mora (2) - 8 freq gond (2) - 1 freq mwd (2) - 1 freq |
movd (0) - 1 freq mvd (1) - 1 freq moved (1) - 192 freq mond (2) - 4 freq muved (2) - 29 freq move (2) - 314 freq mold (2) - 2 freq mood (2) - 82 freq maved (2) - 1 freq movs (2) - 2 freq ovd (2) - 3 freq motd (2) - 1 freq mowd (2) - 2 freq mov (2) - 3 freq mod (2) - 10 freq vd (3) - 2 freq macd (3) - 12 freq mpd (3) - 1 freq mild (3) - 40 freq moody (3) - 5 freq mud (3) - 35 freq dvd (3) - 11 freq goved (3) - 2 freq moov (3) - 3 freq mv (3) - 2 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 |
MOVD |
| Time to execute Levenshtein function - 0.257764 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.366161 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.028424 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.039674 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.001011 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. |