| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| muvin (0) - 12 freq muin (1) - 96 freq muvit (1) - 5 freq luvin (1) - 26 freq mavin (1) - 1 freq mivin (1) - 1 freq muvikn (1) - 1 freq huvin (1) - 150 freq muivin (1) - 17 freq movin (1) - 124 freq muvvin (1) - 2 freq mutvin (1) - 1 freq nuin (2) - 14 freq muntin (2) - 11 freq morin (2) - 2 freq duin (2) - 392 freq curin (2) - 5 freq muins (2) - 12 freq moving (2) - 23 freq majin (2) - 1 freq snuvin (2) - 2 freq evin (2) - 64 freq eevin (2) - 5 freq tovin (2) - 8 freq murn (2) - 9 freq |
muvin (0) - 12 freq mivin (1) - 1 freq muivin (1) - 17 freq mavin (1) - 1 freq movin (1) - 124 freq luvin (2) - 26 freq meevin (2) - 17 freq muin (2) - 96 freq movan (2) - 10 freq muvvin (2) - 2 freq mutvin (2) - 1 freq muvikn (2) - 1 freq huvin (2) - 150 freq muvit (2) - 5 freq maain (3) - 2 freq avin (3) - 2 freq rovin (3) - 6 freq mun (3) - 20 freq vin (3) - 6 freq lavin (3) - 2 freq maukin (3) - 35 freq wauvin (3) - 1 freq mimin (3) - 2 freq sivin (3) - 4 freq kevin (3) - 45 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 |
MUVIN |
| Time to execute Levenshtein function - 0.194773 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.333351 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.027793 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.036455 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.000838 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. |