Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
napoleon (0) - 35 freq napolean (1) - 2 freq napoleonic (2) - 4 freq nicolson (3) - 1 freq napolionic (3) - 1 freq apollo (3) - 13 freq naples (3) - 1 freq apein (4) - 3 freq appleby (4) - 2 freq nappie (4) - 1 freq paplin (4) - 1 freq plen (4) - 109 freq batallon (4) - 1 freq napalm (4) - 3 freq pigeon (4) - 37 freq neon (4) - 7 freq colon (4) - 1 freq impoleet (4) - 1 freq pavilion (4) - 2 freq apples (4) - 10 freq neo-con (4) - 3 freq napper (4) - 36 freq nappers (4) - 6 freq carolro (4) - 17 freq aileen (4) - 7 freq |
napoleon (0) - 35 freq napolean (1) - 2 freq napoleonic (3) - 4 freq naples (4) - 1 freq napolionic (4) - 1 freq pulein (5) - 2 freq nailin (5) - 1 freq nylon (5) - 4 freq nippen (5) - 1 freq applyin (5) - 5 freq speleen (5) - 3 freq napkin (5) - 9 freq expleen (5) - 4 freq nappin (5) - 1 freq spleen (5) - 1 freq plein (5) - 1 freq pleen (5) - 1 freq appliein (5) - 2 freq apollo (5) - 13 freq nicolson (5) - 1 freq plen (5) - 109 freq paplin (5) - 1 freq napalm (5) - 3 freq pylon (5) - 1 freq spoween (6) - 1 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 - NPLN napoleon - 35 freq napolean - 2 freq |
NAPOLEON |
Time to execute Levenshtein function - 0.210203 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.382122 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.028236 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.038386 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.000943 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. |