| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cosla (0) - 1 freq cola (1) - 10 freq osla (1) - 1 freq costa (1) - 7 freq copula (2) - 6 freq tesla (2) - 2 freq coklay (2) - 1 freq coln (2) - 2 freq coal (2) - 132 freq folla (2) - 19 freq colly (2) - 1 freq coli (2) - 1 freq cosh (2) - 12 freq isla (2) - 26 freq cools (2) - 6 freq cowld (2) - 52 freq comma (2) - 1 freq foula (2) - 7 freq coul (2) - 56 freq coulda (2) - 29 freq coda (2) - 3 freq pola (2) - 6 freq coia (2) - 1 freq cossy (2) - 1 freq cost (2) - 113 freq |
cosla (0) - 1 freq cosily (2) - 1 freq costa (2) - 7 freq osla (2) - 1 freq cola (2) - 10 freq col (3) - 11 freq coble (3) - 5 freq cusa (3) - 1 freq costly (3) - 4 freq cole (3) - 1 freq casa (3) - 1 freq cosam (3) - 3 freq coull (3) - 27 freq cosie (3) - 22 freq csa (3) - 1 freq cos' (3) - 1 freq cala (3) - 1 freq cosby (3) - 1 freq cla (3) - 1 freq coste (3) - 1 freq carla (3) - 5 freq coll (3) - 7 freq costo (3) - 1 freq oslo (3) - 11 freq coyle (3) - 53 freq |
SoundEx code - C240 casually - 14 freq chuckle - 11 freq cockle - 4 freq cheisel - 2 freq co-equally - 1 freq casual - 22 freq cycle - 22 freq chisel - 9 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 - KSL casually - 14 freq casual - 22 freq gazelle - 7 freq cassle - 1 freq guzzle - 4 freq cosla - 1 freq casel - 1 freq cosily - 1 freq kiss'll - 1 freq case-law - 1 freq coocil - 1 freq €œguzul - 4 freq guzul - 86 freq guzull - 1 freq wxl - 2 freq gsalaw - 1 freq |
COSLA |
| Time to execute Levenshtein function - 0.315443 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.388939 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.028918 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.036725 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.000786 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. |