Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
carbolic (0) - 3 freq catholic (2) - 52 freq carbolickt (2) - 1 freq carbollick (2) - 1 freq carlie (3) - 2 freq cadboll (3) - 1 freq garlic (3) - 13 freq chronic (3) - 7 freq catholik (3) - 1 freq carolina (3) - 8 freq carolst (3) - 1 freq cyrillic (3) - 1 freq carolro (3) - 17 freq caroosin (3) - 1 freq carol (3) - 62 freq sardonic (3) - 1 freq carboot (3) - 3 freq carlin (3) - 6 freq warblin (3) - 1 freq carrolls (3) - 1 freq caroline (3) - 26 freq awbodic (3) - 1 freq carole (3) - 3 freq carols (3) - 3 freq caroll (3) - 2 freq |
carbolic (0) - 3 freq cyrillic (4) - 1 freq carbollick (4) - 1 freq catholic (4) - 52 freq carbolickt (4) - 1 freq carmic (5) - 2 freq frolic (5) - 1 freq caroll (5) - 2 freq carole (5) - 3 freq acrylic (5) - 2 freq carroll (5) - 6 freq carols (5) - 3 freq symbolic (5) - 9 freq carolm (5) - 2 freq corbled (5) - 1 freq carolle (5) - 2 freq colic (5) - 4 freq cablin (5) - 1 freq caroline (5) - 26 freq carbon (5) - 7 freq barlic (5) - 1 freq acerbic (5) - 1 freq carolro (5) - 17 freq carolina (5) - 8 freq garlic (5) - 13 freq |
SoundEx code - C614 cheerfully - 4 freq carefully - 40 freq creepy-lookin - 1 freq careful - 43 freq corbeille - 1 freq criffel - 5 freq criffel's - 1 freq craw-aipple - 1 freq creppul - 1 freq crippul's - 1 freq cripplin - 3 freq crippled - 2 freq chirpled - 1 freq carbolic - 3 freq cheerfilly - 1 freq cairfully - 4 freq crippuls - 1 freq crippelt - 2 freq cheerful - 3 freq cripple - 6 freq carbolickt - 1 freq curry-flavoured - 1 freq carefil - 1 freq 'careful - 1 freq carefuul - 1 freq chair-o-planes - 1 freq crippilt - 1 freq crapless - 1 freq corbled - 1 freq cairavel - 1 freq cruppilt - 1 freq creepily - 1 freq carefu-like - 5 freq cripples - 1 freq carefullie - 1 freq cripplingly - 2 freq carbollick - 1 freq |
MetaPhone code - KRBLK grey-black - 1 freq carbolic - 3 freq carbollick - 1 freq |
CARBOLIC |
Time to execute Levenshtein function - 0.210016 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.365588 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.027529 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.036984 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.000844 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. |