| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cuchullin (0) - 3 freq chillin (3) - 6 freq achillin (3) - 1 freq shullin (3) - 3 freq schulin (3) - 2 freq crauchillin (3) - 1 freq cochlin (3) - 1 freq schuilin (3) - 6 freq scullion (4) - 2 freq pummellin (4) - 1 freq cuchulainn's (4) - 1 freq curlin (4) - 17 freq counsellin (4) - 2 freq chuggin (4) - 4 freq michelin (4) - 4 freq fulfillin (4) - 4 freq schoolin (4) - 4 freq hurlin (4) - 21 freq cushin (4) - 3 freq curmurrin (4) - 1 freq chisellin (4) - 1 freq fullin (4) - 29 freq crochlin (4) - 1 freq wullin (4) - 23 freq shuillin (4) - 1 freq |
cuchullin (0) - 3 freq cochlin (4) - 1 freq achillin (4) - 1 freq chillin (4) - 6 freq crauchillin (4) - 1 freq schuilin (5) - 6 freq schulin (5) - 2 freq shullin (5) - 3 freq chirlin (6) - 1 freq wachlin (6) - 2 freq compellin (6) - 5 freq churchillian (6) - 1 freq rochlin (6) - 1 freq pauchlin (6) - 17 freq shellin (6) - 3 freq schilling (6) - 1 freq crekillin (6) - 1 freq fauchlin (6) - 1 freq callin (6) - 30 freq scrollin (6) - 6 freq schullar (6) - 1 freq crahlin (6) - 1 freq duachlin (6) - 1 freq pochlin (6) - 1 freq bauchlin (6) - 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 - KXLN keechlin - 2 freq cashline - 1 freq cochalene - 1 freq cochlin - 1 freq cuchullin - 3 freq |
CUCHULLIN |
| Time to execute Levenshtein function - 0.246789 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.421225 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.036683 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.041744 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.000838 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. |