| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| packagin (0) - 6 freq packaging (1) - 2 freq package (2) - 28 freq packin (2) - 20 freq packaged (2) - 2 freq packages (2) - 1 freq packmen (3) - 2 freq puckin (3) - 10 freq pickan (3) - 4 freq cackin (3) - 1 freq pacean (3) - 1 freq parafin (3) - 1 freq damagin (3) - 3 freq paradin (3) - 2 freq mackin (3) - 1 freq pacin (3) - 11 freq peckin (3) - 16 freq rackonin (3) - 1 freq acktin (3) - 1 freq cacklin (3) - 1 freq pakaged (3) - 1 freq hackin (3) - 7 freq packing (3) - 6 freq paawin (3) - 1 freq racklin (3) - 3 freq |
packagin (0) - 6 freq packaging (2) - 2 freq packages (3) - 1 freq packaged (3) - 2 freq package (3) - 28 freq packin (3) - 20 freq peckage (4) - 2 freq peckin (4) - 16 freq packman (4) - 3 freq puckin (4) - 10 freq picklin (4) - 2 freq pickin (4) - 108 freq pickan (4) - 4 freq packmen (4) - 2 freq sackin (5) - 4 freq wackin (5) - 1 freq paikin (5) - 3 freq pillagin (5) - 3 freq tackan (5) - 1 freq lackin (5) - 14 freq ackin (5) - 5 freq spackin (5) - 5 freq parkin (5) - 16 freq pickeen (5) - 1 freq racketin (5) - 1 freq |
SoundEx code - P225 physician - 3 freq possession - 38 freq psychin - 3 freq pig-ignorant - 1 freq 'physeecian - 1 freq possessions - 5 freq peekie-kind - 1 freq possessionis - 1 freq packagin - 6 freq packaging - 2 freq possessing - 1 freq psocmj - 1 freq |
MetaPhone code - PKJN packagin - 6 freq |
PACKAGIN |
| Time to execute Levenshtein function - 0.215480 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.397270 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.027549 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.036947 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.000829 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. |