| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| movin (0) - 124 freq mowin (1) - 2 freq moving (1) - 23 freq movie (1) - 15 freq mooin (1) - 4 freq govin (1) - 9 freq lovin (1) - 51 freq morvin (1) - 2 freq mavin (1) - 1 freq tovin (1) - 8 freq movan (1) - 10 freq movin' (1) - 2 freq mivin (1) - 1 freq rovin (1) - 6 freq movit (1) - 6 freq 'movin (1) - 1 freq morin (1) - 2 freq muvin (1) - 12 freq dovin (1) - 2 freq mopin (1) - 1 freq momin (1) - 10 freq mowi (2) - 1 freq dooin (2) - 2 freq motien (2) - 2 freq moupin (2) - 1 freq |
movin (0) - 124 freq movan (1) - 10 freq mivin (1) - 1 freq mavin (1) - 1 freq muvin (1) - 12 freq meevin (2) - 17 freq movit (2) - 6 freq muivin (2) - 17 freq 'movin (2) - 1 freq momin (2) - 10 freq rovin (2) - 6 freq morin (2) - 2 freq dovin (2) - 2 freq mopin (2) - 1 freq movin' (2) - 2 freq moving (2) - 23 freq mowin (2) - 2 freq mooin (2) - 4 freq movie (2) - 15 freq morvin (2) - 2 freq lovin (2) - 51 freq tovin (2) - 8 freq govin (2) - 9 freq mon (3) - 145 freq ievin (3) - 1 freq |
SoundEx code - M150 muvin - 12 freq movin - 124 freq mopin - 1 freq muivin - 17 freq meevin - 17 freq moppin - 2 freq movan - 10 freq movin' - 2 freq mobbin - 1 freq muvvin - 2 freq moppan - 1 freq movvan - 1 freq mappin' - 1 freq moupin - 1 freq mavin - 1 freq mappiemou - 1 freq mappie-mou - 2 freq €œmappin - 1 freq mivin - 1 freq moappin - 1 freq muffin - 16 freq mpm - 1 freq 'movin - 1 freq movinÂ’ - 1 freq |
MetaPhone code - MFN muvin - 12 freq movin - 124 freq muivin - 17 freq meevin - 17 freq movan - 10 freq movin' - 2 freq muvvin - 2 freq movvan - 1 freq mavin - 1 freq mivin - 1 freq meghan - 2 freq meighan - 11 freq muffin - 16 freq 'movin - 1 freq movinÂ’ - 1 freq |
MOVIN |
| Time to execute Levenshtein function - 0.181737 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.353242 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.028595 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.037775 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.000804 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. |