| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| passpoorts (0) - 1 freq passports (1) - 8 freq pasports (2) - 1 freq passport (2) - 16 freq pasport (3) - 5 freq passportin (3) - 2 freq 'passports' (3) - 1 freq password (4) - 5 freq spoots (4) - 12 freq skysports (4) - 2 freq soorts (4) - 2 freq transports (4) - 1 freq an'spoarts (4) - 1 freq passions (4) - 3 freq passionate (4) - 6 freq €œsports (4) - 1 freq earspoons (4) - 1 freq spoarts (4) - 3 freq cesspools (4) - 1 freq grassroots (4) - 43 freq airports (4) - 3 freq proports (4) - 1 freq spoors (4) - 1 freq phosporus (4) - 1 freq phosphorus (4) - 1 freq |
passpoorts (0) - 1 freq passports (1) - 8 freq passport (3) - 16 freq pasports (3) - 1 freq passportin (4) - 2 freq pasport (5) - 5 freq 'passports' (5) - 1 freq sports (6) - 64 freq an'spoarts (6) - 1 freq €œsports (6) - 1 freq asserts (6) - 1 freq supports (6) - 21 freq phosporus (6) - 1 freq proports (6) - 1 freq spoarts (6) - 3 freq skysports (6) - 2 freq spurts (7) - 1 freq possters (7) - 1 freq pass-mates (7) - 1 freq prospects (7) - 7 freq sprots (7) - 2 freq passowre (7) - 7 freq sproots (7) - 2 freq prospert (7) - 1 freq sprouts (7) - 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 |
PASSPOORTS |
| Time to execute Levenshtein function - 0.231741 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.437363 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.059831 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.050720 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.001105 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. |