Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cheerful (0) - 3 freq cheerfu (1) - 4 freq cheerfully (2) - 4 freq cheerin (3) - 25 freq cheerly (3) - 1 freq heedfu (3) - 1 freq cheerfilly (3) - 1 freq cheel (3) - 11 freq ferful (3) - 2 freq careful (3) - 43 freq cheesel (3) - 1 freq heidful (3) - 1 freq gleeful (3) - 2 freq cheerily (3) - 5 freq cheery (3) - 43 freq powerful (3) - 21 freq cheerie (3) - 11 freq tearful (3) - 2 freq fearful (3) - 10 freq cheers (3) - 219 freq cheryl (3) - 2 freq cheerios (3) - 5 freq pooerful (3) - 10 freq cheered (3) - 27 freq cheneril (3) - 1 freq |
cheerful (0) - 3 freq cheerfu (2) - 4 freq cheerfully (3) - 4 freq careful (4) - 43 freq cheryl (4) - 2 freq cheerily (4) - 5 freq colorful (4) - 1 freq cheerly (4) - 1 freq cheerfilly (4) - 1 freq earful (5) - 2 freq fraerful (5) - 1 freq faerful (5) - 2 freq cheerio (5) - 65 freq cheer (5) - 154 freq cheering (5) - 2 freq cheerit (5) - 1 freq churnil (5) - 1 freq choral (5) - 2 freq chordal (5) - 1 freq colourful (5) - 4 freq charnel (5) - 2 freq churl (5) - 1 freq carefil (5) - 1 freq cherlie (5) - 133 freq cheery (5) - 1 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 - XRFL cheerfully - 4 freq shrivel - 3 freq cheerfilly - 1 freq cheerful - 3 freq |
CHEERFUL |
Time to execute Levenshtein function - 0.351676 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.378471 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.027972 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.038146 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.000889 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. |