Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
muvin (0) - 12 freq muvvin (1) - 2 freq movin (1) - 130 freq muivin (1) - 17 freq huvin (1) - 156 freq muvit (1) - 5 freq mavin (1) - 1 freq muin (1) - 100 freq luvin (1) - 26 freq mutvin (1) - 1 freq mivin (1) - 1 freq muvikn (1) - 1 freq muve (2) - 20 freq mulkin (2) - 1 freq morin (2) - 2 freq wivin (2) - 1 freq maukin (2) - 35 freq lukin (2) - 52 freq snuvin (2) - 2 freq vin (2) - 6 freq wuin (2) - 3 freq mumpin (2) - 6 freq mustn (2) - 2 freq muttin (2) - 3 freq bulin (2) - 1 freq |
muvin (0) - 12 freq mivin (1) - 1 freq mavin (1) - 1 freq muivin (1) - 17 freq movin (1) - 130 freq muvikn (2) - 1 freq movan (2) - 10 freq meevin (2) - 17 freq muvvin (2) - 2 freq mutvin (2) - 1 freq luvin (2) - 26 freq muvit (2) - 5 freq huvin (2) - 156 freq muin (2) - 100 freq min (3) - 513 freq hevin (3) - 20 freq menin (3) - 2 freq eevin (3) - 5 freq marvin (3) - 8 freq savin (3) - 38 freq evin (3) - 64 freq nevin (3) - 1 freq main (3) - 289 freq movin' (3) - 2 freq govin (3) - 9 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 |
MUVIN |
Time to execute Levenshtein function - 0.198179 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.381651 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.028255 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.038356 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.000935 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. |