| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kipper (0) - 5 freq tipper (1) - 14 freq ripper (1) - 10 freq dipper (1) - 3 freq lipper (1) - 14 freq sipper (1) - 6 freq nipper (1) - 1 freq skipper (1) - 51 freq pipper (1) - 2 freq kippers (1) - 7 freq nipped (2) - 22 freq wapper (2) - 2 freq lapper (2) - 1 freq nippen (2) - 1 freq lippen (2) - 68 freq flipper (2) - 2 freq liper (2) - 1 freq caipper (2) - 1 freq capper (2) - 2 freq kuiper (2) - 11 freq popper (2) - 3 freq kivver (2) - 6 freq napper (2) - 36 freq copper (2) - 22 freq swipper (2) - 8 freq |
kipper (0) - 5 freq nipper (2) - 1 freq skipper (2) - 51 freq kippers (2) - 7 freq sipper (2) - 6 freq pipper (2) - 2 freq lipper (2) - 14 freq tipper (2) - 14 freq ripper (2) - 10 freq dipper (2) - 3 freq keeper (3) - 43 freq topper (3) - 12 freq bopper (3) - 3 freq nippier (3) - 1 freq knapper (3) - 2 freq keiper (3) - 1 freq dapper (3) - 4 freq supper (3) - 171 freq vupper (3) - 1 freq 'upper (3) - 1 freq tapper (3) - 1 freq keppet (3) - 1 freq kipple (3) - 2 freq kipperin (3) - 1 freq keppers (3) - 1 freq |
SoundEx code - K160 keeper - 43 freq kiver - 5 freq keiper - 1 freq kipper - 5 freq khyber - 1 freq kuiper - 11 freq kivver - 6 freq kivvver - 1 freq kaffir - 2 freq keeper - 1 freq |
MetaPhone code - KPR keeper - 43 freq copper - 22 freq caper - 14 freq keiper - 1 freq caipper - 1 freq kipper - 5 freq coapper - 1 freq cupar - 5 freq cooper - 18 freq coupar - 3 freq capper - 2 freq kuiper - 11 freq cowper - 2 freq keeper - 1 freq couper - 2 freq |
KIPPER |
| Time to execute Levenshtein function - 0.202441 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.344432 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.027550 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.037249 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.000801 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. |