| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cajoling (0) - 1 freq cairling (2) - 1 freq calling (2) - 15 freq caroline (2) - 26 freq cooling (2) - 1 freq cackling (2) - 2 freq carolina (2) - 8 freq carling (2) - 3 freq cavorting (3) - 1 freq cashline (3) - 1 freq catering (3) - 1 freq gambling (3) - 3 freq paddling (3) - 3 freq capering (3) - 1 freq carving (3) - 2 freq hauling (3) - 1 freq joking (3) - 1 freq cacklin (3) - 2 freq rassling (3) - 2 freq caitlin (3) - 4 freq carlin (3) - 6 freq babbling (3) - 2 freq casting (3) - 1 freq cradling (3) - 1 freq schooling (3) - 1 freq |
cajoling (0) - 1 freq cairling (3) - 1 freq cooling (3) - 1 freq carling (3) - 3 freq calling (3) - 15 freq ceiling (4) - 11 freq cycling (4) - 5 freq culling (4) - 2 freq caroline (4) - 26 freq cling (4) - 7 freq cackling (4) - 2 freq curling (4) - 3 freq carolina (4) - 8 freq calming (5) - 1 freq drooling (5) - 2 freq wailing (5) - 1 freq tackling (5) - 2 freq karling (5) - 1 freq haunling (5) - 6 freq crawling (5) - 1 freq pooling (5) - 1 freq carting (5) - 1 freq cawing (5) - 3 freq cablin (5) - 1 freq cashing (5) - 1 freq |
SoundEx code - C245 cacklin - 2 freq cooglin - 1 freq chuckling - 1 freq cushle-mushle - 1 freq chucklin - 3 freq chucklan - 1 freq coaglin - 1 freq cajoling - 1 freq cacklan - 1 freq cashline - 1 freq cyclin - 4 freq cackle-handit - 1 freq cochalene - 1 freq cuchulainn's - 1 freq cochlin - 1 freq cuchullin - 3 freq chisolm - 1 freq couslem - 1 freq caiklin - 1 freq chisholm - 11 freq cackling - 2 freq chisholme - 3 freq casualness - 1 freq chisellin - 1 freq cyclemorgan - 1 freq cycling - 5 freq chisholmiain - 8 freq chocolonely - 1 freq cyclonic - 1 freq cyclingdumfries - 1 freq cislondon - 1 freq |
MetaPhone code - KJLNK cajoling - 1 freq |
CAJOLING |
| Time to execute Levenshtein function - 0.192919 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.408198 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.038108 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.039926 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.000912 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. |