| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keepan (0) - 12 freq keegan (1) - 2 freq keepin (1) - 213 freq peepan (1) - 3 freq keekan (1) - 2 freq keepen (1) - 1 freq keepin' (2) - 8 freq lepan (2) - 1 freq keepet (2) - 1 freq peeran (2) - 2 freq keepy (2) - 1 freq seepin (2) - 13 freq sleepan (2) - 23 freq helpan (2) - 1 freq feehan (2) - 1 freq teeman (2) - 2 freq beean (2) - 1 freq keep (2) - 1525 freq weeman (2) - 9 freq keenin (2) - 10 freq pleepan (2) - 1 freq ken-an (2) - 3 freq keelin (2) - 1 freq creepan (2) - 1 freq kertan (2) - 1 freq |
keepan (0) - 12 freq keepen (1) - 1 freq keepin (1) - 213 freq keipin (2) - 2 freq keekan (2) - 2 freq peepan (2) - 3 freq keegan (2) - 2 freq keekin (3) - 126 freq keeped (3) - 1 freq keeping (3) - 44 freq weepin (3) - 1 freq keepid (3) - 3 freq keppin (3) - 10 freq kieran (3) - 26 freq keiran (3) - 3 freq kepand (3) - 2 freq keepit (3) - 151 freq keeper (3) - 43 freq beepin (3) - 3 freq deepen (3) - 6 freq keen (3) - 204 freq kenan (3) - 3 freq keeps (3) - 158 freq peepin (3) - 6 freq kpn (3) - 1 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 |
KEEPAN |
| Time to execute Levenshtein function - 0.305270 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.529650 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.058643 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.039250 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.000842 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. |