| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| muivin (0) - 17 freq muivit (1) - 7 freq muvin (1) - 12 freq mivin (1) - 1 freq mutvin (1) - 1 freq muvvin (1) - 2 freq hivin (2) - 27 freq deivin (2) - 1 freq buidin (2) - 1 freq drivin (2) - 104 freq cuisin (2) - 1 freq muffin (2) - 16 freq guisin (2) - 30 freq mullin (2) - 3 freq laivin (2) - 2 freq muivs (2) - 1 freq muntin (2) - 11 freq movin (2) - 130 freq beivin (2) - 1 freq mikin (2) - 1 freq minin (2) - 26 freq divin (2) - 13 freq muisic (2) - 76 freq uizin (2) - 12 freq cuilin (2) - 1 freq |
muivin (0) - 17 freq muvin (1) - 12 freq mivin (1) - 1 freq meevin (2) - 17 freq movin (2) - 130 freq muivit (2) - 7 freq mavin (2) - 1 freq mutvin (2) - 1 freq muvvin (2) - 2 freq muvit (3) - 5 freq milin (3) - 2 freq elivin (3) - 1 freq muive (3) - 26 freq luvin (3) - 26 freq meinin (3) - 1 freq alivin (3) - 1 freq icivin (3) - 1 freq livin (3) - 336 freq seivin (3) - 4 freq givin (3) - 8 freq marvin (3) - 8 freq wuiven (3) - 3 freq huvin (3) - 156 freq sivin (3) - 4 freq melvin (3) - 3 freq |
SoundEx code - M150 muvin - 12 freq movin - 130 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 - 130 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 |
MUIVIN |
| Time to execute Levenshtein function - 0.193837 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.329673 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.027301 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.036798 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.000857 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. |