Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kuiper (0) - 11 freq guizer (2) - 4 freq cuiter (2) - 1 freq juicer (2) - 1 freq upper (2) - 51 freq kipper (2) - 2 freq quiver (2) - 6 freq iper (2) - 7 freq kulter (2) - 5 freq guiser (2) - 1 freq kiver (2) - 3 freq jumper (2) - 41 freq dumper (2) - 1 freq sniper (2) - 3 freq viper (2) - 1 freq keeper (2) - 42 freq puirer (2) - 6 freq paiper (2) - 7 freq keipet (2) - 1 freq peiper (2) - 1 freq fusper (2) - 16 freq suiner (2) - 27 freq knipes (2) - 3 freq kniped (2) - 1 freq 'upper (2) - 1 freq |
kuiper (0) - 11 freq keeper (2) - 42 freq peiper (3) - 1 freq paiper (3) - 7 freq keipet (3) - 1 freq super (3) - 30 freq kaiser (3) - 1 freq piper (3) - 24 freq neiper (3) - 6 freq liper (3) - 1 freq viper (3) - 1 freq riper (3) - 4 freq upper (3) - 51 freq kipper (3) - 2 freq iper (3) - 7 freq kiver (3) - 3 freq kumar (4) - 1 freq veeper (4) - 2 freq pauper (4) - 4 freq gyper (4) - 1 freq kip (4) - 38 freq wyper (4) - 1 freq kepe (4) - 4 freq couper (4) - 2 freq keir (4) - 9 freq |
SoundEx code - K160 keeper - 42 freq kiver - 3 freq khyber - 1 freq kuiper - 11 freq kivver - 6 freq kipper - 2 freq kivvver - 1 freq kaffir - 2 freq keeper - 1 freq |
MetaPhone code - KPR keeper - 42 freq copper - 21 freq caper - 14 freq coapper - 1 freq cupar - 5 freq cooper - 18 freq coupar - 3 freq capper - 2 freq kuiper - 11 freq kipper - 2 freq cowper - 2 freq keeper - 1 freq couper - 2 freq |
KUIPER |
Time to execute Levenshtein function - 0.175687 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.748521 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.056833 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.074874 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.000932 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. |