| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cecilia (0) - 2 freq ceilin (2) - 65 freq celia (2) - 2 freq emilia (2) - 4 freq swcecilia (2) - 1 freq tecklin (3) - 1 freq declin (3) - 1 freq deila (3) - 1 freq deilie (3) - 2 freq hecklin (3) - 1 freq ceilins (3) - 8 freq celin (3) - 1 freq ceilan (3) - 1 freq ceildh (3) - 3 freq recitin (3) - 7 freq recile (3) - 1 freq decidin (3) - 17 freq ceiling (3) - 11 freq heilin (3) - 1 freq camilla (3) - 2 freq ilia (3) - 1 freq declir (3) - 1 freq ceilidh (3) - 24 freq recitit (3) - 5 freq kecklin (3) - 11 freq |
cecilia (0) - 2 freq celia (3) - 2 freq clelia (4) - 5 freq cycle (4) - 24 freq ceivil (4) - 6 freq cochlea (4) - 2 freq coocil (4) - 1 freq chailie (4) - 1 freq recile (4) - 1 freq hecla (4) - 4 freq cyclin (4) - 4 freq swcecilia (4) - 1 freq ceilin (4) - 65 freq emilia (4) - 4 freq coolie (5) - 3 freq coil (5) - 1 freq cclop (5) - 1 freq yclla (5) - 1 freq ceebocelia (5) - 1 freq copula (5) - 6 freq cumuli (5) - 1 freq recoil (5) - 3 freq cello (5) - 2 freq canali (5) - 2 freq sculie (5) - 1 freq |
SoundEx code - C240 casually - 16 freq chuckle - 12 freq cockle - 4 freq cheisel - 2 freq co-equally - 1 freq casual - 22 freq cycle - 24 freq chisel - 10 freq cassle - 1 freq cackle - 7 freq chickle - 1 freq cosla - 1 freq cheekily - 3 freq chessel - 1 freq cajole - 1 freq casel - 1 freq chicl - 1 freq chook'll - 1 freq cosily - 1 freq chesell - 1 freq coaxial - 1 freq cochlea - 2 freq cheesel - 1 freq coggly - 1 freq case-law - 1 freq coocil - 1 freq cigale - 1 freq €˜cigale - 1 freq €œcysill - 1 freq chagall - 1 freq cagoule - 2 freq coklay - 1 freq cyexul - 1 freq cashley - 2 freq cecilia - 2 freq |
MetaPhone code - SSL sicily - 5 freq 'sicilia' - 1 freq €œcysill - 1 freq sizzle - 1 freq sassilia - 1 freq cecilia - 2 freq xsl - 1 freq zsl - 1 freq sazleh - 1 freq sosoally - 1 freq |
CECILIA |
| Time to execute Levenshtein function - 0.187449 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.412735 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.029718 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.037752 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.000926 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. |