Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
passport (0) - 16 freq passports (1) - 8 freq pasport (1) - 5 freq passpoorts (2) - 1 freq password (2) - 5 freq passportin (2) - 2 freq pasports (2) - 1 freq stvsport (3) - 2 freq pandjsport (3) - 1 freq asseert (3) - 1 freq passowre (3) - 7 freq passions (3) - 3 freq raport (3) - 1 freq asseirt (3) - 1 freq assert (3) - 7 freq passit (3) - 19 freq airport (3) - 20 freq btsport (3) - 1 freq tayport (3) - 2 freq bbcsport (3) - 5 freq passt (3) - 23 freq fassont (3) - 1 freq pastor (3) - 1 freq fairport (3) - 1 freq transport (3) - 29 freq |
passport (0) - 16 freq pasport (2) - 5 freq passports (2) - 8 freq passportin (3) - 2 freq passpoorts (3) - 1 freq pasports (4) - 1 freq prospert (4) - 1 freq password (4) - 5 freq passt (5) - 23 freq btsport (5) - 1 freq sport (5) - 153 freq westport (5) - 3 freq pass't (5) - 1 freq assert (5) - 7 freq passit (5) - 19 freq assurt (5) - 1 freq passowre (5) - 7 freq asseirt (5) - 1 freq asseert (5) - 1 freq support (6) - 339 freq possters (6) - 1 freq plestert (6) - 2 freq pussion't (6) - 1 freq plastert (6) - 1 freq misspelt (6) - 1 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 - PSPRT passport - 16 freq pasport - 5 freq |
PASSPORT |
Time to execute Levenshtein function - 0.218027 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.367690 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.028166 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.036643 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.000813 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. |