| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pasports (0) - 1 freq passports (1) - 8 freq pasport (1) - 5 freq €œsports (2) - 1 freq passport (2) - 16 freq proports (2) - 1 freq passpoorts (2) - 1 freq sports (2) - 64 freq lamposts (3) - 1 freq basturts (3) - 4 freq supports (3) - 21 freq transports (3) - 1 freq 'passports' (3) - 1 freq pastures (3) - 4 freq aspekts (3) - 1 freq ports (3) - 10 freq bastarts (3) - 24 freq pastor (3) - 1 freq ramparts (3) - 2 freq spurts (3) - 1 freq tayport (3) - 2 freq escorts (3) - 1 freq mascorns (3) - 1 freq pastoral (3) - 6 freq papists (3) - 2 freq |
pasports (0) - 1 freq pasport (2) - 5 freq passports (2) - 8 freq passpoorts (3) - 1 freq proports (3) - 1 freq sports (3) - 64 freq passport (4) - 16 freq spurts (4) - 1 freq €œsports (4) - 1 freq spoarts (4) - 3 freq paerts (5) - 1 freq paper's (5) - 2 freq asserts (5) - 1 freq parts (5) - 24 freq spots (5) - 31 freq pairts (5) - 230 freq spores (5) - 2 freq imports (5) - 2 freq sport (5) - 155 freq soorts (5) - 2 freq skysports (5) - 2 freq pasturs (5) - 1 freq despots (5) - 5 freq sprots (5) - 2 freq sprouts (5) - 8 freq |
SoundEx code - P216 pig-fermer - 1 freq pig-bairn - 2 freq phosphor - 1 freq passport - 16 freq passports - 8 freq passportin - 2 freq 'passports' - 1 freq phosphorescent - 1 freq passpartout'd - 1 freq passover - 3 freq passkeeper's - 1 freq phosporus - 1 freq phosphorus - 1 freq pasport - 5 freq pasports - 1 freq passpoorts - 1 freq px-princepotemkinnobleman - 1 freq piesportsscot - 1 freq pxpurt - 1 freq |
MetaPhone code - PSPRTS passports - 8 freq 'passports' - 1 freq pasports - 1 freq passpoorts - 1 freq |
PASPORTS |
| Time to execute Levenshtein function - 0.223673 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.375548 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.031550 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.039520 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.000946 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. |