Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kbgc (0) - 1 freq ggc (2) - 1 freq kge (2) - 1 freq bkc (2) - 1 freq ebc (2) - 1 freq ksc (2) - 1 freq kfc (2) - 5 freq bgt (2) - 1 freq tbc (2) - 4 freq ibgz (2) - 1 freq kgs (2) - 1 freq kbp (2) - 1 freq wbgy (2) - 1 freq keg (2) - 2 freq bc (2) - 21 freq gegc (2) - 1 freq fbmgc (2) - 1 freq sbc (2) - 1 freq kgb (2) - 3 freq kgq (2) - 1 freq kbll (2) - 1 freq bmc (2) - 7 freq gc (2) - 3 freq kegs (2) - 8 freq igc (2) - 1 freq |
kbgc (0) - 1 freq bg (4) - 5 freq kbip (4) - 1 freq byc (4) - 1 freq abg (4) - 1 freq bbc (4) - 174 freq cbg (4) - 1 freq kic (4) - 1 freq bbcc (4) - 1 freq ixgc (4) - 1 freq lbc (4) - 1 freq ktsc (4) - 1 freq bac (4) - 11 freq kmc (4) - 2 freq ubg (4) - 4 freq ubgt (4) - 1 freq bcc (4) - 1 freq abc (4) - 2 freq kbmf (4) - 1 freq cbqc (4) - 1 freq ebg (4) - 1 freq kwc (4) - 1 freq kbd (4) - 1 freq vcgc (4) - 1 freq kb (4) - 4 freq |
SoundEx code - K120 keeps - 161 freq keep's - 3 freq kybosh - 3 freq kebbock - 2 freq kips - 3 freq keps - 6 freq kubis - 3 freq kebbuck - 5 freq kippage - 1 freq kebbok - 1 freq keb-hoose - 1 freq keep-hoose - 3 freq kfc - 5 freq ksvvkca - 1 freq kfcs - 1 freq kpj - 1 freq koyehhbiis - 1 freq kpju - 1 freq kibosh - 1 freq keeeeebzy - 2 freq kpxs - 1 freq kjjvsgo - 1 freq kbaek - 1 freq kps - 1 freq kjovoiz - 1 freq kyefis - 1 freq kbgc - 1 freq kbzjo - 1 freq |
MetaPhone code - KBKK cbqc - 1 freq kbgc - 1 freq |
KBGC |
Time to execute Levenshtein function - 0.220998 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.316226 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.027493 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.038571 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.000964 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. |