| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| codlins (0) - 4 freq codlin (1) - 3 freq codlin's (1) - 13 freq collins (1) - 3 freq coins (2) - 50 freq codeine (2) - 1 freq coddlin (2) - 1 freq coddin (2) - 2 freq coggins (2) - 1 freq coffins (2) - 6 freq collies (2) - 1 freq hidlins (2) - 10 freq godlin (2) - 1 freq colline (2) - 1 freq cowdlin (2) - 1 freq ceilins (2) - 8 freq cousins (2) - 46 freq ootlins (2) - 2 freq norlins (2) - 1 freq comins (2) - 4 freq yorlins (2) - 3 freq lodgins (2) - 1 freq lordlins (2) - 1 freq cooling (2) - 1 freq couplins (2) - 1 freq |
codlins (0) - 4 freq codlin (2) - 3 freq collins (2) - 3 freq codlin's (2) - 13 freq ceilins (3) - 8 freq couplins (3) - 1 freq hidlins (3) - 10 freq colin's (4) - 5 freq coding (4) - 1 freq conlin (4) - 5 freq coolin (4) - 2 freq cooling (4) - 1 freq clans (4) - 26 freq dealins (4) - 5 freq goblins (4) - 1 freq codonas (4) - 1 freq dailins (4) - 4 freq lordlins (4) - 1 freq carlines (4) - 3 freq colin (4) - 56 freq yirdlins (4) - 1 freq sidelins (4) - 4 freq collin (4) - 2 freq coddin (4) - 2 freq coggins (4) - 1 freq |
SoundEx code - C345 cheetlin - 1 freq cuddlin - 4 freq cuddle-an - 1 freq catalan - 24 freq catalans - 3 freq catalonia - 8 freq cuittle'm - 1 freq codlin's - 13 freq codlins - 4 freq codlin - 3 freq cuddlean - 1 freq catalunya - 3 freq catilin - 1 freq chat-line - 1 freq cuddlan - 1 freq cowdlin - 1 freq catalonians - 2 freq cattleman - 2 freq coddlin - 1 freq cuttlin - 1 freq €˜cotillions - 1 freq catalunia - 1 freq cuddling - 1 freq caitlinlfcx - 1 freq caitlin - 3 freq catalonie - 1 freq cdolan - 12 freq |
MetaPhone code - KTLNS kittliness - 1 freq catalans - 3 freq codlin's - 13 freq codlins - 4 freq kittlins' - 1 freq kittlins - 5 freq kettleens - 3 freq kitlins - 6 freq guidelines - 26 freq kittlin's - 2 freq quaetlins - 10 freq godliness - 1 freq €˜cotillions - 1 freq |
CODLINS |
| Time to execute Levenshtein function - 0.188714 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.367028 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.027651 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.037057 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.000826 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. |