| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| muivin (0) - 17 freq mivin (1) - 1 freq muivit (1) - 7 freq muvvin (1) - 2 freq mutvin (1) - 1 freq muvin (1) - 12 freq reivin (2) - 13 freq meinin (2) - 1 freq huvin (2) - 150 freq hivin (2) - 26 freq leivin (2) - 57 freq luvin (2) - 26 freq skivin (2) - 3 freq juicin (2) - 2 freq elivin (2) - 1 freq murnin (2) - 14 freq rivin (2) - 28 freq ruinin (2) - 1 freq wivin (2) - 1 freq ruisin (2) - 2 freq deivin (2) - 1 freq huvvin (2) - 4 freq mungin (2) - 2 freq tuinin (2) - 1 freq mimin (2) - 2 freq |
muivin (0) - 17 freq mivin (1) - 1 freq muvin (1) - 12 freq movin (2) - 124 freq meevin (2) - 17 freq mavin (2) - 1 freq mutvin (2) - 1 freq muvvin (2) - 2 freq muivit (2) - 7 freq minin (3) - 26 freq livin (3) - 334 freq heivin (3) - 12 freq muived (3) - 22 freq muvikn (3) - 1 freq muivs (3) - 1 freq haivin (3) - 3 freq maitin (3) - 1 freq mailin (3) - 3 freq divin (3) - 13 freq mainin (3) - 3 freq maikin (3) - 1 freq muvit (3) - 5 freq mikin (3) - 1 freq seivin (3) - 4 freq sivin (3) - 4 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 |
MUIVIN |
| Time to execute Levenshtein function - 0.204280 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.345952 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.030402 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.036531 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.000899 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. |