| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kjcsf (0) - 2 freq kmcsv (2) - 1 freq kfcs (2) - 1 freq kjist (2) - 1 freq cjisf (2) - 1 freq kcf (2) - 1 freq jhs (3) - 2 freq kc (3) - 7 freq kick (3) - 120 freq njesi (3) - 1 freq jas (3) - 1 freq kkwdf (3) - 1 freq jhsh (3) - 1 freq pjs (3) - 1 freq kbmf (3) - 1 freq csd (3) - 11 freq bicnf (3) - 1 freq kies (3) - 1 freq kace (3) - 2 freq kwf (3) - 1 freq sf (3) - 6 freq kess (3) - 5 freq kyf (3) - 1 freq ajust (3) - 2 freq jyst (3) - 7 freq |
kjcsf (0) - 2 freq kcf (4) - 1 freq cjisf (4) - 1 freq kfcs (4) - 1 freq kmcsv (4) - 1 freq kjist (4) - 1 freq kaces (5) - 1 freq djixf (6) - 1 freq kiss' (6) - 1 freq kjm (6) - 1 freq gncwf (6) - 1 freq mcf (6) - 3 freq kjow (6) - 1 freq kush (6) - 1 freq kyns (6) - 2 freq kist (6) - 116 freq kwc (6) - 1 freq zjf (6) - 1 freq kiss (6) - 120 freq gjbzf (6) - 1 freq zmcmf (6) - 1 freq joss (6) - 2 freq njc (6) - 1 freq vgcf (6) - 1 freq kless (6) - 1 freq |
SoundEx code - K100 keep - 1525 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 - KJKSF wcjxf - 1 freq kjcsf - 2 freq |
KJCSF |
| Time to execute Levenshtein function - 0.229842 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.352808 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.027707 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.038469 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.000786 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. |