Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kgv (0) - 1 freq kgb (1) - 3 freq mgv (1) - 1 freq kg (1) - 4 freq kgs (1) - 1 freq kev (1) - 6 freq agv (1) - 1 freq kge (1) - 1 freq kkv (1) - 1 freq jgv (1) - 1 freq kv (1) - 10 freq ygv (1) - 1 freq kpv (1) - 1 freq hgv (1) - 3 freq gv (1) - 11 freq kgq (1) - 1 freq kgd (1) - 2 freq ccv (2) - 1 freq bev (2) - 1 freq agi (2) - 1 freq kf (2) - 3 freq kxx (2) - 1 freq xgj (2) - 1 freq yav (2) - 1 freq ga (2) - 29 freq |
kgv (0) - 1 freq ygv (2) - 1 freq kv (2) - 10 freq kpv (2) - 1 freq gv (2) - 11 freq kgd (2) - 2 freq jgv (2) - 1 freq hgv (2) - 3 freq kgq (2) - 1 freq mgv (2) - 1 freq kkv (2) - 1 freq kgb (2) - 3 freq kg (2) - 4 freq kgs (2) - 1 freq kge (2) - 1 freq agv (2) - 1 freq kev (2) - 6 freq jgvo (3) - 1 freq kegs (3) - 8 freq keg (3) - 2 freq gav (3) - 2 freq gov (3) - 39 freq gva (3) - 1 freq ykg (3) - 1 freq ikg (3) - 1 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 - KKF kick-aff - 4 freq kcf - 1 freq qcf - 1 freq kick-off - 1 freq coycfuu - 1 freq ccv - 1 freq wqcv - 1 freq cokvi - 1 freq gcf - 1 freq qkf - 1 freq kcwphh - 1 freq kgv - 1 freq qkkf - 1 freq |
KGV |
Time to execute Levenshtein function - 0.217194 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.346404 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.031440 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.041112 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.000989 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. |