| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keepitna (0) - 1 freq keeping (2) - 44 freq keepin (2) - 218 freq keepit (2) - 151 freq keepin' (2) - 8 freq kennitna (2) - 1 freq keipin (3) - 2 freq kepit (3) - 3 freq weeping (3) - 3 freq keenins (3) - 1 freq keipit (3) - 4 freq peepin' (3) - 1 freq keelin (3) - 1 freq ceptna (3) - 2 freq keepid (3) - 3 freq keepen (3) - 1 freq kempins (3) - 1 freq kentna (3) - 12 freq keppin (3) - 10 freq weepin (3) - 1 freq seepin (3) - 15 freq keekit (3) - 47 freq keelit (3) - 1 freq kelpit (3) - 4 freq seepit (3) - 4 freq |
keepitna (0) - 1 freq keepin (3) - 218 freq keepit (3) - 151 freq kentna (4) - 12 freq keepan (4) - 12 freq keppin (4) - 10 freq keepet (4) - 1 freq keepen (4) - 1 freq keep'n (4) - 1 freq kepta (4) - 1 freq ceptna (4) - 2 freq kennitna (4) - 1 freq keepin' (4) - 8 freq keeping (4) - 44 freq kepit (4) - 3 freq keipin (4) - 2 freq keipit (4) - 4 freq kippin (5) - 1 freq kerpit (5) - 3 freq kestin (5) - 2 freq beepin (5) - 3 freq kempin (5) - 5 freq keipet (5) - 1 freq kempton (5) - 4 freq keypt (5) - 1 freq |
SoundEx code - K135 kaftan - 1 freq kipeet-nosed - 1 freq keepitna - 1 freq kipfatnh - 1 freq kbdnsehr - 1 freq |
MetaPhone code - KPTN captain - 71 freq captin - 2 freq capten - 3 freq keepitna - 1 freq |
KEEPITNA |
| Time to execute Levenshtein function - 0.183759 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.384190 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.029792 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.039343 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.000914 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. |