| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kuiper (0) - 11 freq keiper (1) - 1 freq vupper (2) - 1 freq puirer (2) - 6 freq cuiter (2) - 1 freq viper (2) - 1 freq sniper (2) - 3 freq neiper (2) - 6 freq iper (2) - 7 freq peiper (2) - 1 freq dumper (2) - 1 freq fusper (2) - 18 freq keipet (2) - 1 freq liper (2) - 1 freq kipper (2) - 5 freq cuiver (2) - 4 freq 'upper (2) - 1 freq guider (2) - 4 freq jumper (2) - 43 freq uiser (2) - 5 freq kiver (2) - 5 freq kniped (2) - 1 freq paiper (2) - 7 freq quiver (2) - 6 freq bumper (2) - 4 freq |
kuiper (0) - 11 freq keiper (1) - 1 freq keeper (2) - 44 freq kipper (3) - 5 freq kiver (3) - 5 freq liper (3) - 1 freq paiper (3) - 7 freq super (3) - 37 freq piper (3) - 31 freq keipet (3) - 1 freq kaiser (3) - 1 freq riper (3) - 4 freq upper (3) - 55 freq iper (3) - 7 freq viper (3) - 1 freq neiper (3) - 6 freq peiper (3) - 1 freq sper (4) - 1 freq kaypee (4) - 2 freq kepe (4) - 4 freq keipin (4) - 2 freq kir (4) - 2 freq spier (4) - 42 freq kaip (4) - 2 freq neeper (4) - 5 freq |
SoundEx code - K160 keeper - 44 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 - 44 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 |
KUIPER |
| Time to execute Levenshtein function - 0.193923 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.393354 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.028537 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.038473 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. |