| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dodgson (0) - 9 freq hodgson (1) - 2 freq dodgan (2) - 1 freq dudgeon (2) - 1 freq dobson (2) - 4 freq dodgin (2) - 4 freq doags (3) - 6 freq rowson (3) - 2 freq dods (3) - 8 freq dogs (3) - 44 freq dod's (3) - 9 freq gorgon (3) - 3 freq poison (3) - 28 freq dodos (3) - 1 freq addison (3) - 31 freq dodger (3) - 5 freq fordson (3) - 3 freq dodo (3) - 79 freq dodging (3) - 2 freq dousin (3) - 1 freq hudson (3) - 9 freq coulson (3) - 2 freq dodged (3) - 6 freq dowgs (3) - 3 freq hodgin (3) - 3 freq |
dodgson (0) - 9 freq hodgson (2) - 2 freq dudgeon (3) - 1 freq dodgin (3) - 4 freq dodgan (3) - 1 freq dodges (4) - 2 freq dobson (4) - 4 freq addison (4) - 31 freq dowsin (5) - 2 freq damson (5) - 1 freq lodgin (5) - 5 freq danson (5) - 1 freq dragon (5) - 38 freq dodge (5) - 12 freq dodgers (5) - 2 freq doggin (5) - 10 freq dodjin (5) - 1 freq dodgy (5) - 38 freq davison (5) - 1 freq doesn (5) - 11 freq dossin (5) - 3 freq dodgin' (5) - 1 freq doosin (5) - 2 freq dyson (5) - 1 freq dragoon (5) - 1 freq |
SoundEx code - D325 dodgson - 9 freq dudgeon - 1 freq dootsumness - 1 freq detachment - 2 freq detachments - 1 freq dodging - 2 freq dodgin' - 1 freq dodjin - 1 freq dutchmen - 1 freq doutsum - 1 freq deid-saumon - 1 freq dootsome - 1 freq deid-centre - 1 freq dodgan - 1 freq dowdoswang - 1 freq deid-sang - 1 freq deith-knell - 1 freq deid-knowes - 1 freq doutsomelike - 1 freq doutsome-like - 1 freq doutsome - 1 freq dootsum - 4 freq dutchman - 2 freq dodgin - 4 freq detachin - 1 freq didsna - 1 freq deadkings - 1 freq datsun - 3 freq dodgingtherain - 1 freq |
MetaPhone code - TTKSN dodgson - 9 freq |
DODGSON |
| Time to execute Levenshtein function - 0.214978 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.372862 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.027609 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.037259 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.000887 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. |