| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cadgin (0) - 2 freq cadgie (1) - 2 freq gadgin (1) - 1 freq wadgin (1) - 4 freq cauvin (2) - 1 freq cauin (2) - 1 freq ladin (2) - 1 freq cal'in (2) - 1 freq jaggin (2) - 9 freq cavin (2) - 1 freq hodgin (2) - 3 freq clangin (2) - 6 freq pidgin (2) - 4 freq mangin (2) - 13 freq cartin (2) - 1 freq cannin (2) - 3 freq canglin (2) - 1 freq cantin (2) - 4 freq casin (2) - 3 freq fidgin (2) - 13 freq carpin (2) - 2 freq taggin (2) - 3 freq margin (2) - 3 freq cassin (2) - 4 freq cadgier (2) - 1 freq |
cadgin (0) - 2 freq cadgie (2) - 2 freq wadgin (2) - 4 freq gadgin (2) - 1 freq coagin (3) - 1 freq cadge (3) - 2 freq cadged (3) - 1 freq aidgin (3) - 1 freq budgin (3) - 3 freq edgin (3) - 3 freq dodgin (3) - 4 freq claagin (3) - 2 freq judgin (3) - 17 freq cadgy (3) - 1 freq cadger (3) - 5 freq wedgin (3) - 1 freq nudgin (3) - 4 freq waidgin (3) - 1 freq lodgin (3) - 5 freq ludgin (3) - 7 freq codlin (3) - 3 freq cadgier (3) - 1 freq codgie (3) - 2 freq nidgin (3) - 3 freq coddin (3) - 2 freq |
SoundEx code - C325 catchin - 55 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 - KJN gadgin - 1 freq gougin - 1 freq cadgin - 2 freq gai-jin - 1 freq coagin - 1 freq gjaain - 2 freq kijn - 1 freq gjaan - 1 freq |
CADGIN |
| Time to execute Levenshtein function - 0.190760 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.390265 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.029227 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.037747 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.000932 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. |