| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edick (0) - 1 freq edict (1) - 2 freq dick (1) - 78 freq flick (2) - 26 freq medics (2) - 4 freq duck (2) - 60 freq mick (2) - 20 freq €™ick (2) - 56 freq elic (2) - 2 freq slick (2) - 10 freq edith (2) - 18 freq edi (2) - 1 freq evict (2) - 2 freq eik (2) - 90 freq chick (2) - 16 freq spick (2) - 95 freq lerick (2) - 1 freq dirk (2) - 29 freq buick (2) - 1 freq dick' (2) - 3 freq edit (2) - 17 freq trick (2) - 68 freq edcrick (2) - 5 freq knick (2) - 2 freq erik (2) - 2 freq |
edick (0) - 1 freq dick (1) - 78 freq dock (2) - 32 freq duick (2) - 1 freq duck (2) - 60 freq deck (2) - 70 freq dicky (2) - 2 freq edict (2) - 2 freq quick (3) - 374 freq enack (3) - 1 freq dics (3) - 1 freq alick (3) - 1 freq saick (3) - 1 freq eyck (3) - 1 freq eleck (3) - 4 freq tick (3) - 69 freq dicks (3) - 8 freq kick (3) - 122 freq dice (3) - 13 freq disk (3) - 1 freq dink (3) - 2 freq teeick (3) - 2 freq rick (3) - 4 freq dueck (3) - 1 freq ducky (3) - 7 freq |
SoundEx code - E320 edge - 190 freq eats - 30 freq etec - 1 freq eh-it's - 1 freq etc - 191 freq eattocks - 1 freq edgy - 7 freq eit's - 29 freq et's - 8 freq eits - 1 freq etse - 1 freq eets - 58 freq eet's - 58 freq eat's - 1 freq eddie's - 3 freq edick - 1 freq etts - 2 freq eddies - 1 freq ethic - 1 freq eatch - 1 freq eds - 9 freq etch - 2 freq ethics - 3 freq etc' - 3 freq eidduc - 1 freq ethos - 2 freq €™edge - 1 freq etjwh - 1 freq ehts - 1 freq etxu - 1 freq etoo's - 1 freq edg - 1 freq 'eats - 2 freq ethgx - 1 freq edj - 1 freq etg - 1 freq etsy - 1 freq etjx - 1 freq eoeutzi - 1 freq |
MetaPhone code - ETK etec - 1 freq etc - 191 freq edick - 1 freq etc' - 3 freq eidduc - 1 freq edg - 1 freq etg - 1 freq |
EDICK |
| Time to execute Levenshtein function - 0.228469 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.376263 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.029474 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.041323 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.001091 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. |