| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| packagin (0) - 6 freq packaging (1) - 2 freq packaged (2) - 2 freq packages (2) - 1 freq package (2) - 28 freq packin (2) - 20 freq acktin (3) - 1 freq ackin (3) - 5 freq spackin (3) - 5 freq managin (3) - 21 freq tackin (3) - 1 freq peckin (3) - 16 freq puckin (3) - 10 freq pillagin (3) - 3 freq pickin (3) - 111 freq packam (3) - 1 freq massagin (3) - 2 freq tacklin (3) - 4 freq rampagin (3) - 5 freq parkin (3) - 16 freq paikin (3) - 3 freq packit (3) - 17 freq paradin (3) - 2 freq parafin (3) - 1 freq bandagin (3) - 1 freq |
packagin (0) - 6 freq packaging (2) - 2 freq packin (3) - 20 freq package (3) - 28 freq packaged (3) - 2 freq packages (3) - 1 freq pickin (4) - 111 freq puckin (4) - 10 freq packmen (4) - 2 freq peckin (4) - 16 freq packman (4) - 3 freq peckage (4) - 2 freq pickan (4) - 4 freq picklin (4) - 2 freq racketin (5) - 1 freq cackin (5) - 1 freq backin (5) - 41 freq cacklin (5) - 2 freq lackin (5) - 14 freq packa (5) - 1 freq tackan (5) - 1 freq presagin (5) - 2 freq pacean (5) - 1 freq pakkaged (5) - 1 freq packing (5) - 6 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.411414 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.775870 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.028325 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.092107 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.000894 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. |