| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cuchulainn's (2) - 1 freq cuchullin (2) - 3 freq cumplainen (4) - 1 freq schulin (4) - 2 freq cochlin (4) - 1 freq such-like (5) - 1 freq undulatin (5) - 1 freq calculation (5) - 3 freq cuilin (5) - 1 freq unlairn (5) - 1 freq nicholsonn (5) - 1 freq chucking (5) - 2 freq chilblains (5) - 6 freq calcultion (5) - 1 freq cackling (5) - 2 freq cushin (5) - 3 freq duachlin (5) - 1 freq rochlin (5) - 1 freq circulatin (5) - 1 freq samhuinn (5) - 1 freq cuddlin (5) - 4 freq bucklin (5) - 7 freq chillin (5) - 6 freq buchtitin (5) - 1 freq churnin (5) - 9 freq |
cuchullin (3) - 3 freq cuchulainn's (4) - 1 freq cochlin (5) - 1 freq cumplainen (6) - 1 freq schulin (6) - 2 freq cochalene (6) - 1 freq cochran (7) - 1 freq schlagen (7) - 1 freq cullinan (7) - 3 freq crochlin (7) - 1 freq schuilin (7) - 6 freq touchline (7) - 14 freq eichmann (7) - 1 freq cullanain (7) - 1 freq buchanan (7) - 32 freq crahlin (7) - 1 freq cyclin (7) - 4 freq achillin (7) - 1 freq complainin (7) - 20 freq wachlin (7) - 2 freq cacklin (7) - 2 freq cochrane (7) - 4 freq crauchillin (7) - 1 freq pochlin (7) - 1 freq scotlann (7) - 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 |
CUCHULAINN |
| Time to execute Levenshtein function - 0.386274 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.645424 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.032588 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.067810 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.001007 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. |