| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cathkin (0) - 7 freq cathrin (1) - 1 freq bathin (2) - 11 freq athein (2) - 1 freq cashin (2) - 1 freq catilin (2) - 1 freq athin (2) - 226 freq cathie (2) - 1 freq cackin (2) - 1 freq wahkin (2) - 1 freq nathin (2) - 6 freq aathin (2) - 203 freq caukin (2) - 1 freq gathin (2) - 2 freq caterin (2) - 4 freq clathin (2) - 1 freq catchin (2) - 52 freq nithin (3) - 71 freq nothin (3) - 174 freq takkin (3) - 507 freq aathing (3) - 176 freq cookin (3) - 43 freq cuttin (3) - 73 freq yalkin (3) - 2 freq bakin (3) - 23 freq |
cathkin (0) - 7 freq cathrin (2) - 1 freq catchin (4) - 52 freq clathin (4) - 1 freq gathin (4) - 2 freq catherine (4) - 12 freq chokin (4) - 28 freq choakin (4) - 1 freq chukin (4) - 1 freq thakin (4) - 1 freq caukin (4) - 1 freq caterin (4) - 4 freq catilin (4) - 1 freq athin (4) - 226 freq cashin (4) - 1 freq athein (4) - 1 freq bathin (4) - 11 freq aathin (4) - 203 freq cathie (4) - 1 freq nathin (4) - 6 freq wahkin (4) - 1 freq cackin (4) - 1 freq taikin (5) - 1 freq achin (5) - 14 freq catholic (5) - 51 freq |
SoundEx code - C325 catchin - 52 freq citizens - 28 freq cawd-cannie - 1 freq catchment - 3 freq cadgin - 2 freq catchen - 2 freq catching - 8 freq catchin' - 2 freq chuddy-chaaen - 1 freq citizen' - 1 freq citizen - 10 freq catchan - 12 freq catchments - 1 freq catacombs - 2 freq cathkin - 7 freq ceitizans - 1 freq ceitizens - 2 freq cøttikin - 1 freq ceetizenship - 1 freq citizenship - 9 freq €œcitizens - 8 freq ceitezans - 4 freq ceitezan - 2 freq ceetizen - 1 freq ceetizens - 6 freq cÃtizen - 1 freq cow-the-gowan - 1 freq cdgm - 1 freq ctogngxyyo - 1 freq citizenveurm - 1 freq citizenstheatre - 1 freq citizentommy - 1 freq cwdsnmo - 1 freq ctznmgyp - 1 freq |
MetaPhone code - K0KN cathkin - 7 freq |
CATHKIN |
| Time to execute Levenshtein function - 0.204028 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.348506 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.027169 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.037878 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.000968 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. |