| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keepin (0) - 213 freq seepin (1) - 13 freq keepit (1) - 151 freq beepin (1) - 3 freq keepan (1) - 12 freq peepin (1) - 6 freq keekin (1) - 126 freq weepin (1) - 1 freq keepin' (1) - 8 freq kempin (1) - 5 freq keepid (1) - 3 freq keipin (1) - 2 freq keeping (1) - 44 freq keenin (1) - 10 freq keelin (1) - 1 freq keepen (1) - 1 freq keppin (1) - 10 freq meevin (2) - 17 freq kenin (2) - 2 freq feezin (2) - 2 freq heppin (2) - 1 freq weedin (2) - 7 freq keep's (2) - 3 freq geetin (2) - 1 freq keep (2) - 1525 freq |
keepin (0) - 213 freq keipin (1) - 2 freq keepen (1) - 1 freq keepan (1) - 12 freq keepid (2) - 3 freq keppin (2) - 10 freq keeping (2) - 44 freq keenin (2) - 10 freq kempin (2) - 5 freq keelin (2) - 1 freq seepin (2) - 13 freq keepin' (2) - 8 freq beepin (2) - 3 freq keepit (2) - 151 freq weepin (2) - 1 freq keekin (2) - 126 freq peepin (2) - 6 freq klein (3) - 5 freq keikin (3) - 10 freq deepen (3) - 6 freq keekan (3) - 2 freq eekin (3) - 1 freq keepitna (3) - 1 freq keegan (3) - 2 freq yelpin (3) - 3 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 |
KEEPIN keep - 1525 freq keeping - 44 freq keepin - 213 freq kept - 504 freq |
| Time to execute Levenshtein function - 0.206233 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.358475 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.027492 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.038356 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.000848 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. |