Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
neep-lantern (0) - 3 freq neep-park (5) - 3 freq maneepulaaters (5) - 1 freq deep-layered (5) - 1 freq re-plaster (5) - 1 freq naeplanetb (5) - 1 freq planters (5) - 4 freq lantern (5) - 29 freq lee-lane (5) - 6 freq step-ladder (5) - 1 freq planter (5) - 6 freq neep-perk (5) - 2 freq deepwatter (5) - 1 freq step-sister (6) - 5 freq heid-banger (6) - 1 freq plater (6) - 1 freq splatterd (6) - 1 freq weenter (6) - 4 freq north-eastern (6) - 1 freq ae-lane (6) - 2 freq heelster (6) - 2 freq lentern (6) - 3 freq explaen (6) - 2 freq eg-bater (6) - 1 freq planneen (6) - 1 freq |
neep-lantern (0) - 3 freq planters (8) - 4 freq lantern (8) - 29 freq planter (8) - 6 freq naeplanetb (8) - 1 freq splenterin (8) - 2 freq splatterin (9) - 1 freq splintery (9) - 1 freq plantn (9) - 1 freq loup-hunter (9) - 1 freq plantan (9) - 1 freq explanation (9) - 40 freq plantin (9) - 22 freq lentern (9) - 3 freq explanatory (9) - 2 freq splinter (9) - 4 freq explanator (9) - 11 freq splinters (9) - 2 freq maneepulaaters (9) - 1 freq neep-park (9) - 3 freq deep-layered (9) - 1 freq neep-perk (9) - 2 freq englanders (10) - 1 freq ever-lastin (10) - 1 freq plaster (10) - 14 freq |
SoundEx code - N145 nibbling - 4 freq nibblin - 7 freq neep-lantern - 3 freq napoleon - 35 freq nobleman's - 1 freq napoleonic - 4 freq nebulun - 1 freq nibblan - 4 freq nabblin - 1 freq napolean - 2 freq napalm - 3 freq napolionic - 1 freq noblewimmen - 1 freq naeplanetb - 1 freq |
MetaPhone code - NPLNTRN neep-lantern - 3 freq |
NEEP-LANTERN |
Time to execute Levenshtein function - 0.194802 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.427148 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.028977 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.038469 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.000916 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. |