Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kbll (0) - 1 freq kill (1) - 215 freq kell (1) - 1 freq kull (1) - 3 freq ull (2) - 24 freq fell (2) - 709 freq well (2) - 1394 freq skill (2) - 55 freq dll (2) - 4 freq kyle (2) - 79 freq kael (2) - 5 freq 'tll (2) - 1 freq 'ull (2) - 1 freq 'll (2) - 85 freq bal (2) - 6 freq irll (2) - 1 freq kyl (2) - 1 freq kb (2) - 4 freq €˜ll (2) - 1 freq ably (2) - 1 freq kells (2) - 7 freq dell (2) - 8 freq ll (2) - 69 freq nll (2) - 1 freq mell (2) - 23 freq |
kbll (0) - 1 freq kell (2) - 1 freq kull (2) - 3 freq kill (2) - 215 freq boll (3) - 1 freq kille (3) - 1 freq knell (3) - 5 freq abell (3) - 1 freq killy (3) - 9 freq bill (3) - 549 freq gbell (3) - 1 freq bell (3) - 210 freq kabul (3) - 1 freq bull (3) - 87 freq knoll (3) - 2 freq ball (3) - 62 freq kelly (3) - 144 freq eblul (3) - 10 freq hill (4) - 461 freq €™ll (4) - 1159 freq wull (4) - 1173 freq call (4) - 216 freq blo (4) - 2 freq kiln (4) - 7 freq jell (4) - 3 freq |
SoundEx code - K140 kabul - 1 freq kipple - 2 freq kibbil - 1 freq kevil - 1 freq kibble - 1 freq kbll - 1 freq |
MetaPhone code - KBL coble - 5 freq gabble - 1 freq gobble - 3 freq gable - 8 freq caybul - 1 freq cable - 10 freq kabul - 1 freq cobble - 5 freq gabloo - 1 freq gbell - 1 freq gabala - 1 freq cabal - 2 freq kibbil - 1 freq qbal - 1 freq kibble - 1 freq gbl - 1 freq kbll - 1 freq gablo - 1 freq |
KBLL |
Time to execute Levenshtein function - 0.199484 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.392004 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.027549 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.037133 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.000816 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. |