| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caithlick (0) - 2 freq cathlics (2) - 2 freq caitlin (3) - 4 freq cantick (3) - 1 freq methlick (3) - 1 freq catholics (3) - 10 freq daithlie (3) - 1 freq kethlick (3) - 1 freq catholik (3) - 1 freq paitrick (3) - 1 freq laithlie (3) - 1 freq catholic (3) - 52 freq cafflick (3) - 1 freq mathrick (3) - 1 freq cattrick (3) - 1 freq critics (4) - 17 freq whittrick (4) - 1 freq capitalise (4) - 3 freq swithlie (4) - 1 freq saft-lik (4) - 1 freq carbollick (4) - 1 freq capstick (4) - 1 freq gaithirt (4) - 1 freq capitalism (4) - 15 freq eithlie (4) - 8 freq |
caithlick (0) - 2 freq cathlics (3) - 2 freq catholik (4) - 1 freq catholic (4) - 52 freq catholics (4) - 10 freq kethlick (4) - 1 freq methlick (4) - 1 freq cafflick (5) - 1 freq mathrick (5) - 1 freq cattrick (5) - 1 freq weethick (6) - 1 freq toothpick (6) - 1 freq coenflick (6) - 1 freq thick (6) - 227 freq bet-lick (6) - 1 freq chick (6) - 16 freq cashback (6) - 1 freq click (6) - 132 freq kethlicks (6) - 2 freq cat-like (6) - 1 freq conflick (6) - 2 freq keithjack (6) - 8 freq daithlie (6) - 1 freq cantick (6) - 1 freq caitlin (6) - 4 freq |
SoundEx code - C342 catalogue - 16 freq catholic - 52 freq couthie-like - 2 freq catalyst - 8 freq coat-tails - 5 freq chattels - 1 freq catholics - 10 freq catalogued - 2 freq cuddles - 9 freq coatless - 1 freq cathlics - 2 freq cowt-lik - 1 freq cataloguin' - 2 freq catholicism - 1 freq catalysts - 1 freq cutlasses - 1 freq cuttie-like - 1 freq catwalk - 1 freq catholik - 1 freq cuttie-lik - 2 freq cat-like - 1 freq caithlick - 2 freq chattles - 2 freq cataloag - 1 freq cdlkturj - 1 freq |
MetaPhone code - K0LK catholic - 52 freq couthie-like - 2 freq kethlick - 1 freq catholik - 1 freq caithlick - 2 freq |
CAITHLICK |
| Time to execute Levenshtein function - 0.778523 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 - 1.709694 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.103482 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.199855 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.000922 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. |