| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kpv (0) - 1 freq ppv (1) - 4 freq kev (1) - 6 freq kv (1) - 10 freq kp (1) - 6 freq kkv (1) - 1 freq kpn (1) - 1 freq kgv (1) - 1 freq pv (1) - 3 freq kpt (1) - 1 freq kps (1) - 1 freq kpj (1) - 1 freq srv (2) - 1 freq jp (2) - 7 freq fps (2) - 1 freq mp (2) - 39 freq qhv (2) - 1 freq spl (2) - 4 freq kom (2) - 2 freq pvf (2) - 1 freq qpx (2) - 1 freq keg (2) - 2 freq kre (2) - 1 freq kic (2) - 1 freq 'pc (2) - 1 freq |
kpv (0) - 1 freq kgv (2) - 1 freq pv (2) - 3 freq kpj (2) - 1 freq kpn (2) - 1 freq kps (2) - 1 freq kpt (2) - 1 freq kkv (2) - 1 freq ppv (2) - 4 freq kev (2) - 6 freq kv (2) - 10 freq kp (2) - 6 freq pve (3) - 4 freq kips (3) - 3 freq yppv (3) - 1 freq pov (3) - 1 freq keps (3) - 6 freq kept (3) - 504 freq kep' (3) - 2 freq kap (3) - 1 freq 'pve (3) - 1 freq kapo (3) - 1 freq kop (3) - 2 freq dpve (3) - 1 freq kpju (3) - 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 - KPF kpv - 1 freq |
KPV |
| Time to execute Levenshtein function - 0.349972 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 - 1.070465 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.097363 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.103999 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.000900 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. |