| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edgin (0) - 3 freq edwin (1) - 29 freq edgit (1) - 1 freq edin (1) - 4 freq eggin (1) - 5 freq wedgin (1) - 1 freq elgin (1) - 24 freq edinb (2) - 1 freq egip (2) - 1 freq cadgin (2) - 2 freq reddin (2) - 60 freq engine (2) - 50 freq edgar (2) - 10 freq eamin (2) - 1 freq egil (2) - 4 freq eidein (2) - 1 freq eyin (2) - 1 freq erwin (2) - 1 freq en'in (2) - 5 freq edged (2) - 9 freq eegit (2) - 4 freq odin (2) - 43 freq ein (2) - 86 freq eden (2) - 36 freq evin (2) - 64 freq |
edgin (0) - 3 freq aidgin (2) - 1 freq edwin (2) - 29 freq elgin (2) - 24 freq wedgin (2) - 1 freq edin (2) - 4 freq eggin (2) - 5 freq edgit (2) - 1 freq dmin (3) - 1 freq oagin (3) - 6 freq din (3) - 75 freq egan (3) - 3 freq uggin (3) - 3 freq vigin (3) - 1 freq nidgin (3) - 3 freq judgin (3) - 17 freq ludgin (3) - 7 freq fidgin (3) - 13 freq dain (3) - 144 freq deign (3) - 1 freq admin (3) - 5 freq jeidgin (3) - 1 freq lodgin (3) - 5 freq gin (3) - 1987 freq ragin (3) - 67 freq |
SoundEx code - E325 edgin - 3 freq etchin - 1 freq etchins - 1 freq |
MetaPhone code - EJN edgin - 3 freq eugene - 1 freq aegean - 4 freq aegin - 1 freq |
EDGIN |
| Time to execute Levenshtein function - 0.377984 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.586172 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.027868 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.070527 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. |