| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| packman (0) - 3 freq pac-man (1) - 1 freq packmen (1) - 2 freq jackman (1) - 2 freq spaceman (2) - 1 freq pickan (2) - 4 freq packin (2) - 20 freq packam (2) - 1 freq tacksman (2) - 1 freq packa (2) - 1 freq jakman (2) - 2 freq cacklan (2) - 1 freq backmen (2) - 1 freq packham (2) - 1 freq tackan (2) - 1 freq pinkman (2) - 1 freq walkman (2) - 3 freq wachman (2) - 1 freq pacean (2) - 1 freq kickan (3) - 2 freq sacan (3) - 1 freq packagin (3) - 6 freq cackin (3) - 1 freq markan (3) - 1 freq puskan (3) - 1 freq |
packman (0) - 3 freq packmen (1) - 2 freq pac-man (2) - 1 freq jackman (2) - 2 freq pinkman (3) - 1 freq packam (3) - 1 freq pickan (3) - 4 freq packin (3) - 20 freq backmen (3) - 1 freq pacean (4) - 1 freq packagin (4) - 6 freq pickin (4) - 111 freq peckin (4) - 16 freq wachman (4) - 1 freq pockmanty (4) - 2 freq pickeen (4) - 1 freq picklin (4) - 2 freq puckin (4) - 10 freq spaceman (4) - 1 freq jakman (4) - 2 freq cacklan (4) - 1 freq packa (4) - 1 freq walkman (4) - 3 freq packham (4) - 1 freq tackan (4) - 1 freq |
SoundEx code - P255 pikemen - 1 freq packmen - 2 freq pish-minnies - 1 freq pysonin - 3 freq pizenin - 1 freq poisoning - 3 freq poisonin - 3 freq pokemon - 1 freq pack-mannie - 1 freq poignant - 5 freq pigmen - 1 freq pokmantie - 1 freq pokémon - 1 freq pigments - 1 freq packman - 3 freq pockmanty - 2 freq pachamama - 1 freq poignantly - 1 freq pac-man - 1 freq |
MetaPhone code - PKMN pikemen - 1 freq packmen - 2 freq pokemon - 1 freq pack-mannie - 1 freq pigmen - 1 freq pokémon - 1 freq packman - 3 freq pac-man - 1 freq |
PACKMAN |
| Time to execute Levenshtein function - 0.312291 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.464742 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.029093 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.039551 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.000947 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. |