| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| moving (3) - 24 freq movin' (3) - 2 freq movin (3) - 130 freq movinÂ’ (3) - 1 freq morvin (4) - 2 freq movie (4) - 15 freq 'movin (4) - 1 freq movilla (4) - 3 freq mooin (4) - 4 freq tovin (4) - 8 freq movit (4) - 6 freq mivin (4) - 1 freq movieÂ’ (4) - 1 freq loving (4) - 27 freq lovinly (4) - 2 freq ovine (4) - 1 freq dovin (4) - 2 freq mavin (4) - 1 freq bovine (4) - 2 freq govin (4) - 9 freq morin (4) - 2 freq lovingly (4) - 9 freq lovin' (4) - 2 freq rovin (4) - 6 freq movies (4) - 11 freq |
moving (6) - 24 freq movin (6) - 130 freq movinÂ’ (6) - 1 freq movin' (6) - 2 freq mivin (7) - 1 freq mavin (7) - 1 freq movan (7) - 10 freq muvin (7) - 12 freq lovin' (8) - 2 freq lovingly (8) - 9 freq muivin (8) - 17 freq morin (8) - 2 freq rovin (8) - 6 freq mowin (8) - 2 freq govin (8) - 9 freq lovin (8) - 52 freq meevin (8) - 17 freq mopin (8) - 1 freq momin (8) - 12 freq movies (8) - 11 freq mooin (8) - 4 freq tovin (8) - 8 freq 'movin (8) - 1 freq bovine (8) - 2 freq morvin (8) - 2 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 |
MOVIN� |
| Time to execute Levenshtein function - 0.221517 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.386570 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.029608 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.038477 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.000915 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. |