| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kbp (0) - 1 freq kdp (1) - 1 freq kop (1) - 2 freq kb (1) - 4 freq kep (1) - 136 freq kbd (1) - 1 freq kap (1) - 1 freq bp (1) - 9 freq klp (1) - 1 freq obp (1) - 1 freq kip (1) - 38 freq kp (1) - 6 freq vbp (1) - 1 freq kbip (1) - 1 freq mup (2) - 2 freq tbw (2) - 1 freq wop (2) - 1 freq bxp (2) - 1 freq kemp (2) - 46 freq kxo (2) - 1 freq sb (2) - 4 freq hbv (2) - 1 freq bq (2) - 5 freq kim (2) - 10 freq dbv (2) - 1 freq |
kbp (0) - 1 freq kbip (1) - 1 freq klp (2) - 1 freq obp (2) - 1 freq vbp (2) - 1 freq bp (2) - 9 freq kip (2) - 38 freq kp (2) - 6 freq kap (2) - 1 freq kdp (2) - 1 freq kb (2) - 4 freq kop (2) - 2 freq kbd (2) - 1 freq kep (2) - 136 freq keep (3) - 1547 freq keip (3) - 4 freq kelp (3) - 13 freq kowp (3) - 1 freq fbpe (3) - 2 freq knap (3) - 9 freq ukip (3) - 13 freq bap (3) - 16 freq okap (3) - 1 freq krap (3) - 1 freq kaip (3) - 2 freq |
SoundEx code - K100 keep - 1547 freq kep - 136 freq kip - 38 freq keevee - 1 freq 'keep - 23 freq keip - 4 freq keepy - 1 freq kap - 1 freq 'kappa' - 1 freq kowp - 1 freq kop - 2 freq kepe - 4 freq koffie - 1 freq kep' - 2 freq kaip - 2 freq kaif - 1 freq €™kiep - 1 freq kypie - 1 freq €œkeep - 8 freq keppy - 1 freq €˜keep - 2 freq kappa - 1 freq kb - 4 freq kyoab - 1 freq kee-vee - 2 freq keb - 2 freq €™keep - 1 freq kubby - 1 freq kgb - 3 freq kv - 10 freq kwf - 1 freq ksjyvvf - 1 freq kyf - 1 freq kcf - 1 freq kaypee - 2 freq kf - 3 freq kp - 6 freq kev - 6 freq kif - 1 freq kwuavb - 1 freq kkv - 1 freq kabb - 1 freq kufae - 1 freq ko-fi - 1 freq kxf - 1 freq kcwphh - 1 freq kgv - 1 freq kpv - 1 freq kffi - 1 freq kjcsf - 2 freq kbp - 1 freq kapo - 1 freq |
MetaPhone code - KBP kbip - 1 freq kbp - 1 freq |
KBP |
| Time to execute Levenshtein function - 0.169793 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.336240 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.028729 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.037642 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.000961 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. |