| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keepen (0) - 1 freq keepin (1) - 218 freq keeper (1) - 44 freq keepet (1) - 1 freq keeped (1) - 1 freq keep'n (1) - 1 freq keepan (1) - 12 freq deepen (1) - 6 freq keen (2) - 205 freq kreepee (2) - 1 freq bee-en (2) - 2 freq keipin (2) - 2 freq heeren (2) - 2 freq keegan (2) - 2 freq keele (2) - 1 freq weemen (2) - 176 freq heppen (2) - 11 freq geeten (2) - 1 freq keiper (2) - 1 freq seeped (2) - 5 freq keipet (2) - 1 freq kleen (2) - 1 freq keekan (2) - 2 freq teemen (2) - 2 freq meeten (2) - 1 freq |
keepen (0) - 1 freq keepin (1) - 218 freq keepan (1) - 12 freq keeper (2) - 44 freq keipin (2) - 2 freq keepet (2) - 1 freq deepen (2) - 6 freq keeped (2) - 1 freq keep'n (2) - 1 freq kepe (3) - 4 freq keekin (3) - 126 freq keelin (3) - 1 freq keepy (3) - 1 freq reopen (3) - 1 freq keneen (3) - 2 freq keppin (3) - 10 freq keep (3) - 1547 freq seepin (3) - 15 freq kempin (3) - 5 freq beepin (3) - 3 freq keeps (3) - 161 freq keepid (3) - 3 freq keeping (3) - 44 freq weepin (3) - 1 freq keenin (3) - 10 freq |
SoundEx code - K150 keepin - 218 freq keppin - 10 freq keipin - 2 freq keepin' - 8 freq keepen - 1 freq keep'n - 1 freq kevin - 46 freq kippin - 1 freq keepan - 12 freq kpn - 1 freq kevin' - 1 freq kobweeyin - 1 freq |
MetaPhone code - KPN gowpen - 5 freq keepin - 218 freq coupon - 57 freq cuppin - 6 freq gowpin - 30 freq gapin - 10 freq capone - 1 freq gaupin - 8 freq coupin - 7 freq gawpin - 34 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 keep'n - 1 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 |
KEEPEN |
| Time to execute Levenshtein function - 0.235384 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.409058 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.027837 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.037593 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.000939 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. |