| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| phosphorescent (0) - 1 freq phosphorus (5) - 1 freq phosporus (6) - 1 freq sportscene (6) - 1 freq fluorescent (6) - 4 freq flourescent (6) - 5 freq phosphor (6) - 1 freq efflorescent (6) - 1 freq postponement (6) - 1 freq florescent (6) - 1 freq prospect (7) - 23 freq piesportsscot (7) - 1 freq sportsmen (7) - 3 freq fluorescents (7) - 1 freq proaphesie (7) - 1 freq prophesied (7) - 2 freq adolescent (7) - 4 freq poorpooreffort (7) - 1 freq cheshire-cat (7) - 25 freq present (7) - 213 freq poshest (7) - 2 freq moss-fluorescent (7) - 1 freq horrorseen (7) - 1 freq bioluminescent (7) - 1 freq bbcsportscot (7) - 18 freq |
phosphorescent (0) - 1 freq phosphorus (8) - 1 freq phosporus (10) - 1 freq phosphor (10) - 1 freq florescent (11) - 1 freq cheshire-cat (11) - 25 freq efflorescent (11) - 1 freq fluorescent (11) - 4 freq sportscene (11) - 1 freq flourescent (11) - 5 freq whispereen (12) - 1 freq present (12) - 213 freq poshest (12) - 2 freq represent (12) - 29 freq moss-fluorescent (12) - 1 freq crescent (12) - 21 freq €˜crescent (12) - 1 freq prospect (12) - 23 freq postponement (12) - 1 freq raipresent (12) - 1 freq piesportsscot (12) - 1 freq pumpherston (12) - 1 freq 'present (12) - 1 freq prasent (13) - 1 freq philosophers (13) - 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 - FSFRSNT phosphorescent - 1 freq |
PHOSPHORESCENT |
| Time to execute Levenshtein function - 0.245006 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.416305 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.028798 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.042159 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.000969 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. |