| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gadgin (0) - 1 freq gaddin (1) - 1 freq wadgin (1) - 4 freq gangin (1) - 72 freq gaggin (1) - 7 freq gadgie (1) - 39 freq cadgin (1) - 2 freq gaein (2) - 147 freq wadin (2) - 2 freq aidgin (2) - 1 freq gazin (2) - 18 freq admin (2) - 5 freq gaddir (2) - 1 freq bargin (2) - 2 freq godlin (2) - 1 freq baggin (2) - 2 freq addin (2) - 39 freq ladin (2) - 1 freq pidgin (2) - 4 freq jaggin (2) - 9 freq grudgin (2) - 2 freq gattin (2) - 1 freq gawain (2) - 1 freq ludgin (2) - 7 freq lodgin (2) - 5 freq |
gadgin (0) - 1 freq cadgin (2) - 2 freq gaggin (2) - 7 freq gadgie (2) - 39 freq gangin (2) - 72 freq wadgin (2) - 4 freq gaddin (2) - 1 freq fidgin (3) - 13 freq gadgies (3) - 28 freq dodgin (3) - 4 freq gadget (3) - 2 freq nidgin (3) - 3 freq gyangin (3) - 2 freq waidgin (3) - 1 freq judgin (3) - 17 freq gorgin (3) - 1 freq gudgie (3) - 1 freq gadge (3) - 4 freq giggin (3) - 2 freq gangan (3) - 2 freq gadges (3) - 1 freq hodgin (3) - 3 freq nudgin (3) - 4 freq wedgin (3) - 1 freq gingin (3) - 11 freq |
SoundEx code - G325 gadgin - 1 freq gethsemane - 1 freq good-goin - 1 freq godssend - 3 freq godsend - 3 freq guid-gaun - 3 freq guid-gauin - 1 freq goat-skin - 1 freq goodcompany - 1 freq gatehsenursery - 2 freq guidson - 4 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 |
GADGIN |
| Time to execute Levenshtein function - 0.211674 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.335227 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.028453 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.041257 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.000888 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. |