Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cripplin (0) - 3 freq ripplin (1) - 12 freq rimplin (2) - 1 freq drippin (2) - 23 freq crippled (2) - 2 freq rippin (2) - 21 freq rippling (2) - 1 freq grapplin (2) - 16 freq prippin (2) - 1 freq grippin (2) - 21 freq kipplin (2) - 1 freq trippin (2) - 33 freq crappin (2) - 11 freq cripple (2) - 6 freq stipplin (2) - 1 freq clippin (2) - 12 freq chippin (2) - 7 freq driplin (2) - 1 freq ripplan (2) - 2 freq crinklin (2) - 1 freq cripples (2) - 1 freq tipplin (2) - 1 freq ripplit (2) - 1 freq crumplin (2) - 2 freq clippit (3) - 5 freq |
cripplin (0) - 3 freq ripplin (2) - 12 freq grapplin (3) - 16 freq crumplin (3) - 2 freq crappin (3) - 11 freq cripple (3) - 6 freq cripples (3) - 1 freq ripplan (3) - 2 freq crippled (3) - 2 freq tipplin (4) - 1 freq crinklin (4) - 1 freq driplin (4) - 1 freq crippuls (4) - 1 freq cruppen (4) - 4 freq crimplene (4) - 1 freq crippelt (4) - 2 freq ripplit (4) - 1 freq crippilt (4) - 1 freq chippin (4) - 7 freq rimplin (4) - 1 freq rippin (4) - 21 freq drippin (4) - 23 freq prippin (4) - 1 freq rippling (4) - 1 freq stipplin (4) - 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 - KRPLN cripplin - 3 freq grapplin - 16 freq |
CRIPPLIN |
Time to execute Levenshtein function - 0.482668 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.621326 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.031772 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.066459 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.001020 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. |