| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| veeper (0) - 2 freq keeper (1) - 44 freq neeper (1) - 5 freq deeper (1) - 51 freq sweeper (2) - 3 freq eever (2) - 2 freq deefer (2) - 1 freq keepen (2) - 1 freq weeter (2) - 2 freq beezer (2) - 11 freq beeger (2) - 6 freq deener (2) - 3 freq deepen (2) - 6 freq pepper (2) - 83 freq eezer (2) - 1 freq temper (2) - 50 freq reepepr (2) - 1 freq helper (2) - 5 freq keiper (2) - 1 freq neiper (2) - 6 freq peepee (2) - 18 freq viper (2) - 1 freq peeler (2) - 3 freq keepers (2) - 16 freq keener (2) - 6 freq |
veeper (0) - 2 freq deeper (2) - 51 freq viper (2) - 1 freq neeper (2) - 5 freq keeper (2) - 44 freq paeper (3) - 3 freq reaper (3) - 20 freq peyper (3) - 1 freq neiper (3) - 6 freq deepur (3) - 1 freq veere (3) - 1 freq viewer (3) - 4 freq veer (3) - 1 freq vupper (3) - 1 freq peiper (3) - 1 freq veneer (3) - 1 freq keiper (3) - 1 freq leper (3) - 2 freq neepur (3) - 1 freq eever (3) - 2 freq wyper (4) - 1 freq paiper (4) - 7 freq sper (4) - 1 freq speer (4) - 21 freq taper (4) - 4 freq |
SoundEx code - V160 vapour - 4 freq veeper - 2 freq vibrio - 1 freq viper - 1 freq vovr - 1 freq vhbr - 1 freq vupper - 1 freq |
MetaPhone code - FPR vapour - 4 freq veeper - 2 freq viper - 1 freq fapor - 2 freq vupper - 1 freq |
VEEPER |
| Time to execute Levenshtein function - 0.176954 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.341185 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.039491 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.045480 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.000935 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. |