| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keppin (0) - 10 freq keppit (1) - 17 freq keipin (1) - 2 freq kempin (1) - 5 freq weppin (1) - 1 freq kippin (1) - 1 freq heppin (1) - 1 freq keepin (1) - 213 freq leppin (1) - 7 freq yelpin (2) - 3 freq uppin (2) - 1 freq jappin (2) - 1 freq reapin (2) - 4 freq boppin (2) - 1 freq keepid (2) - 3 freq dippin (2) - 10 freq hippin (2) - 1 freq cappin (2) - 1 freq kempit (2) - 2 freq sippin (2) - 7 freq nippin (2) - 31 freq ceptin (2) - 6 freq pappin (2) - 7 freq keppy (2) - 1 freq kenin (2) - 2 freq |
keppin (0) - 10 freq kippin (1) - 1 freq heppin (2) - 1 freq leppin (2) - 7 freq keepin (2) - 213 freq weppin (2) - 1 freq keppit (2) - 17 freq keipin (2) - 2 freq kempin (2) - 5 freq poppin (3) - 20 freq happin (3) - 16 freq wuppin (3) - 1 freq gappin (3) - 2 freq keppet (3) - 1 freq knypin (3) - 4 freq oppin (3) - 4 freq tippin (3) - 4 freq lippin (3) - 9 freq hoppin (3) - 11 freq moppin (3) - 2 freq tappin (3) - 20 freq rappin (3) - 6 freq appin (3) - 2 freq heppen (3) - 11 freq keepan (3) - 12 freq |
SoundEx code - K150 keepin - 213 freq keppin - 10 freq keipin - 2 freq keepin' - 8 freq keepen - 1 freq kevin - 45 freq kippin - 1 freq keepan - 12 freq kpn - 1 freq kevin' - 1 freq kobweeyin - 1 freq |
MetaPhone code - KPN gowpen - 4 freq keepin - 213 freq coupon - 52 freq cuppin - 6 freq gowpin - 30 freq gapin - 10 freq capone - 1 freq gaupin - 8 freq coupin - 7 freq gawpin - 33 freq cowpin - 26 freq keppin - 10 freq copin - 4 freq keipin - 2 freq keepin' - 8 freq keepen - 1 freq coupen - 1 freq gappen - 2 freq gappin - 2 freq kippin - 1 freq keepan - 12 freq copan - 1 freq coupan - 1 freq gappan - 1 freq gupan - 1 freq gopin - 1 freq gaapin - 1 freq cappin - 1 freq coopin - 1 freq capon - 1 freq kpn - 1 freq 'goupin' - 1 freq goupin - 1 freq |
KEPPIN |
| Time to execute Levenshtein function - 0.201002 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.333386 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.027334 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.036752 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.000779 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. |