| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pam-pon (0) - 1 freq campos (3) - 1 freq amazon (3) - 22 freq tampson (3) - 1 freq rai-con (3) - 1 freq wappon (3) - 4 freq lamb-pot (3) - 1 freq gameon (3) - 1 freq lampin (3) - 6 freq capon (3) - 1 freq patron (3) - 10 freq pamcgoo (3) - 1 freq pampas (3) - 1 freq bampot (3) - 30 freq patreon (3) - 2 freq camelon (3) - 7 freq tamason (3) - 2 freq tamson (3) - 32 freq cameron (3) - 127 freq patmason (3) - 1 freq pappin (3) - 7 freq amfmon (3) - 1 freq lampan (3) - 1 freq apon (3) - 90 freq parton (3) - 4 freq |
pam-pon (0) - 1 freq pumpin (4) - 19 freq put-upon (4) - 1 freq pit-pony (4) - 1 freq p-pain (5) - 1 freq pappin (5) - 7 freq tampan (5) - 1 freq lampan (5) - 1 freq put-on (5) - 1 freq pom-poms (5) - 1 freq campion (5) - 4 freq pac-man (5) - 1 freq rampan (5) - 2 freq paw-phone (5) - 1 freq pappen (5) - 1 freq pit-on (5) - 7 freq rampin (5) - 4 freq papin (5) - 2 freq pamper (5) - 2 freq bampin (5) - 1 freq dampen (5) - 1 freq gampin (5) - 1 freq lampin (5) - 6 freq campin (5) - 4 freq pampas (5) - 1 freq |
SoundEx code - P515 pom-poms - 1 freq pumpin - 19 freq pin-point - 1 freq penny-pincheen - 1 freq pinpoint - 2 freq pam-pon - 1 freq pin-pointin - 1 freq pinpointed - 1 freq pumping - 2 freq pinpint - 1 freq piano-piano - 1 freq pompoms - 1 freq pinpynt - 1 freq pumpin - 1 freq |
MetaPhone code - PMPN pumpin - 19 freq pam-pon - 1 freq pumpin - 1 freq |
PAM-PON |
| Time to execute Levenshtein function - 0.238356 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.348672 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.028778 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.037479 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.000861 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. |