| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knappin (0) - 4 freq knappis (1) - 1 freq snappin (1) - 15 freq knappit (1) - 3 freq klappin (1) - 1 freq happin (2) - 16 freq snapping (2) - 1 freq clappin (2) - 45 freq moappin (2) - 1 freq shappin (2) - 5 freq kippin (2) - 1 freq napkin (2) - 9 freq pappin (2) - 7 freq knypin (2) - 4 freq slappin (2) - 12 freq nippin (2) - 31 freq jappin (2) - 1 freq wrappin (2) - 15 freq appin (2) - 2 freq snappit (2) - 32 freq ehappin (2) - 1 freq kidnappin (2) - 1 freq nappie (2) - 1 freq knapp (2) - 2 freq flappin (2) - 25 freq |
knappin (0) - 4 freq knappis (2) - 1 freq knappit (2) - 3 freq klappin (2) - 1 freq snappin (2) - 15 freq nippin (3) - 31 freq knappy (3) - 1 freq keppin (3) - 10 freq knapper (3) - 2 freq knypin (3) - 4 freq knapp (3) - 2 freq kidnappin (3) - 1 freq nuppin (3) - 1 freq snippin (3) - 1 freq kippin (3) - 1 freq knawin (4) - 3 freq stappin (4) - 45 freq cappin (4) - 1 freq tappin (4) - 20 freq nippan (4) - 1 freq rappin (4) - 6 freq snippen (4) - 2 freq yappin (4) - 8 freq swappin (4) - 6 freq drappin (4) - 67 freq |
SoundEx code - K515 knypin - 4 freq kinfauns - 2 freq knappin - 4 freq kempin - 5 freq knifan - 1 freq kennyfaemacduff - 3 freq kinypin' - 1 freq kimviymka - 1 freq knobends - 1 freq |
MetaPhone code - NPN knypin - 4 freq nippin - 31 freq nippin' - 3 freq nippen - 1 freq knappin - 4 freq nippan - 1 freq nuppin - 1 freq npn - 1 freq |
KNAPPIN |
| Time to execute Levenshtein function - 0.244136 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.347715 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.027204 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.036551 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.000813 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. |