| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| phosphor (0) - 1 freq phosphorus (2) - 1 freq philospher (3) - 1 freq porphory (3) - 1 freq posher (3) - 1 freq prosper (3) - 5 freq phosporus (3) - 1 freq histor (4) - 6 freq popcorn (4) - 7 freq owthor (4) - 11 freq pastor (4) - 1 freq photo (4) - 74 freq shoother (4) - 43 freq poocher (4) - 2 freq poplar (4) - 1 freq picshur (4) - 1 freq hotpot (4) - 1 freq thoor (4) - 11 freq posidon (4) - 1 freq thouchtr (4) - 1 freq prospert (4) - 1 freq hoho (4) - 1 freq spoor (4) - 2 freq choocher (4) - 1 freq hospice (4) - 6 freq |
phosphor (0) - 1 freq phosphorus (3) - 1 freq philospher (4) - 1 freq philosophar (5) - 1 freq philosopher (5) - 9 freq phosporus (5) - 1 freq prosper (5) - 5 freq porphory (5) - 1 freq posher (5) - 1 freq whusper (6) - 20 freq pusher (6) - 3 freq phhr (6) - 1 freq philosphy (6) - 1 freq hasher (6) - 1 freq biosphere (6) - 2 freq pisher (6) - 1 freq whisper (6) - 56 freq picshur (6) - 1 freq kosher (7) - 1 freq whosever (7) - 1 freq preshure (7) - 1 freq poshie (7) - 1 freq periphery (7) - 1 freq honther (7) - 1 freq hostler (7) - 18 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 - FSFR phosphor - 1 freq |
PHOSPHOR |
| Time to execute Levenshtein function - 0.240642 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.427377 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.031315 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.040602 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.001123 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. |