| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keeper (0) - 43 freq keeped (1) - 1 freq keener (1) - 6 freq veeper (1) - 2 freq keiper (1) - 1 freq keeker (1) - 3 freq keepers (1) - 16 freq keepet (1) - 1 freq deeper (1) - 51 freq keepen (1) - 1 freq neeper (1) - 5 freq keele (2) - 1 freq paeper (2) - 3 freq keekers (2) - 3 freq peepers (2) - 6 freq teeter (2) - 1 freq pepper (2) - 83 freq beemer (2) - 2 freq kempers (2) - 2 freq heefer (2) - 1 freq keep (2) - 1525 freq deepur (2) - 1 freq keller (2) - 1 freq heeder (2) - 1 freq keppers (2) - 1 freq |
keeper (0) - 43 freq keiper (1) - 1 freq keepen (2) - 1 freq deeper (2) - 51 freq kuiper (2) - 11 freq keeped (2) - 1 freq keepet (2) - 1 freq neeper (2) - 5 freq veeper (2) - 2 freq keepers (2) - 16 freq keeker (2) - 3 freq keener (2) - 6 freq kipper (3) - 5 freq keepin (3) - 213 freq kepe (3) - 4 freq leper (3) - 2 freq deepur (3) - 1 freq keepan (3) - 12 freq neepur (3) - 1 freq keer (3) - 1 freq reaper (3) - 16 freq peyper (3) - 1 freq keipet (3) - 1 freq paeper (3) - 3 freq keepy (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 |
KEEPER |
| Time to execute Levenshtein function - 0.196617 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.520115 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.027565 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.037195 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.000786 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. |