Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
napolean (0) - 2 freq napoleon (1) - 35 freq fallean (3) - 1 freq maclean (3) - 15 freq naples (3) - 1 freq jacobean (3) - 2 freq galilean (3) - 2 freq cailean (3) - 1 freq napoleonic (3) - 4 freq gappan (4) - 1 freq airlan (4) - 174 freq talkan (4) - 18 freq yoleman (4) - 1 freq powen (4) - 8 freq spean (4) - 2 freq apoplexy (4) - 1 freq abean (4) - 1 freq caperan (4) - 1 freq aleen (4) - 97 freq faalan (4) - 4 freq plea (4) - 20 freq unclean (4) - 6 freq €˜ocean (4) - 2 freq napa (4) - 3 freq appliein (4) - 2 freq |
napolean (0) - 2 freq napoleon (1) - 35 freq naples (4) - 1 freq napoleonic (4) - 4 freq nippan (5) - 1 freq spleen (5) - 1 freq applyin (5) - 5 freq norlan (5) - 21 freq napulitano (5) - 1 freq plaan (5) - 1 freq plan (5) - 236 freq nappin (5) - 1 freq pulein (5) - 2 freq nailin (5) - 1 freq speleen (5) - 3 freq pleen (5) - 1 freq implyan (5) - 1 freq spulyan (5) - 1 freq pleuan (5) - 1 freq napkin (5) - 9 freq plein (5) - 1 freq napalm (5) - 3 freq yplan (5) - 1 freq plen (5) - 109 freq nippen (5) - 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 |
NAPOLEAN |
Time to execute Levenshtein function - 0.259428 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.455485 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.027209 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.040878 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.000889 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. |