Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
crapless (0) - 1 freq tapless (2) - 2 freq crewless (2) - 1 freq hapless (2) - 11 freq draplets (2) - 1 freq coatless (2) - 1 freq stapless (2) - 1 freq cradles (2) - 6 freq crashes (3) - 7 freq cradled (3) - 7 freq crapper (3) - 1 freq daeless (3) - 4 freq coapies (3) - 4 freq grapplers (3) - 1 freq rapes (3) - 1 freq compress (3) - 1 freq craals (3) - 1 freq careless (3) - 10 freq coagles (3) - 1 freq capers (3) - 7 freq cupples (3) - 1 freq helpless (3) - 17 freq caess (3) - 3 freq treeless (3) - 3 freq crashers (3) - 2 freq |
crapless (0) - 1 freq crewless (3) - 1 freq stapless (4) - 1 freq careless (4) - 10 freq coatless (4) - 1 freq cradles (4) - 6 freq draplets (4) - 1 freq tapless (4) - 2 freq hapless (4) - 11 freq chapels (5) - 2 freq dowpless (5) - 2 freq couplets (5) - 1 freq brimless (5) - 1 freq craalies (5) - 3 freq hoppless (5) - 1 freq droplets (5) - 3 freq marless (5) - 8 freq repress (5) - 6 freq craps (5) - 16 freq scruples (5) - 3 freq yearless (5) - 1 freq corpses (5) - 10 freq crass (5) - 4 freq crawlies (5) - 1 freq brainless (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 - KRPLS crippul's - 1 freq crippuls - 1 freq crapless - 1 freq cripples - 1 freq |
CRAPLESS |
Time to execute Levenshtein function - 0.225157 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.425916 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.028616 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.037412 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.000888 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. |