| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| klappin (0) - 1 freq lappin (1) - 20 freq clappin (1) - 45 freq flappin (1) - 25 freq plappin (1) - 2 freq knappin (1) - 4 freq slappin (1) - 12 freq flaapin (2) - 2 freq lapping (2) - 1 freq gappin (2) - 2 freq stappin (2) - 45 freq slippin (2) - 28 freq claspin (2) - 7 freq slappan (2) - 1 freq kippin (2) - 1 freq clappan (2) - 2 freq happin (2) - 16 freq shappin (2) - 5 freq yappin (2) - 8 freq lapsin (2) - 1 freq pappin (2) - 7 freq lippin (2) - 9 freq lampin (2) - 6 freq clappit (2) - 45 freq wrappin (2) - 15 freq |
klappin (0) - 1 freq slappin (2) - 12 freq knappin (2) - 4 freq plappin (2) - 2 freq lappin (2) - 20 freq clappin (2) - 45 freq flappin (2) - 25 freq lippin (3) - 9 freq flappan (3) - 4 freq flippin (3) - 7 freq floppin (3) - 1 freq clippin (3) - 11 freq leppin (3) - 7 freq sluppin (3) - 3 freq keppin (3) - 10 freq kippin (3) - 1 freq clappan (3) - 2 freq slippin (3) - 28 freq lappan (3) - 1 freq slappan (3) - 1 freq clampin (4) - 2 freq laupin (4) - 2 freq trappin (4) - 1 freq rappin (4) - 6 freq slapping (4) - 4 freq |
SoundEx code - K415 keelivine - 2 freq kelvingrove - 5 freq kelvin - 8 freq kelvinbridge - 1 freq kelvinhaw - 1 freq klappin - 1 freq kelvinside - 3 freq keelyvine - 3 freq kelvinhaugh - 1 freq kalvin - 1 freq |
MetaPhone code - KLPN clappin - 45 freq clypin - 8 freq gulpin - 4 freq clippin - 11 freq gollopin - 2 freq clippan - 3 freq gallopin - 6 freq clip-on - 2 freq klappin - 1 freq gallopan - 1 freq clappan - 2 freq glæpin - 1 freq glaepin - 1 freq clipin - 1 freq |
KLAPPIN |
| Time to execute Levenshtein function - 0.222969 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.388453 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.028402 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.037513 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.000804 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. |