| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| epileptic (0) - 4 freq plestic (3) - 4 freq ecliptic (3) - 1 freq eclectic (3) - 1 freq epidemic (3) - 8 freq epilepsy (3) - 5 freq elestic (3) - 2 freq encleetic (3) - 1 freq epidemics (4) - 1 freq expleitit (4) - 1 freq electric (4) - 38 freq elastic (4) - 16 freq elegaic (4) - 2 freq depleetit (4) - 1 freq aplentie (4) - 2 freq plentin (4) - 1 freq ex-leftie (4) - 1 freq spilet (4) - 4 freq sceptic (4) - 2 freq athletic (4) - 7 freq exceptit (4) - 2 freq electin (4) - 2 freq piestir (4) - 1 freq skeptic (4) - 1 freq kinetic (4) - 1 freq |
epileptic (0) - 4 freq ecliptic (4) - 1 freq plestic (4) - 4 freq plastic (5) - 127 freq elestic (5) - 2 freq politic (5) - 5 freq epilepsy (5) - 5 freq eclectic (5) - 1 freq epidemic (6) - 8 freq pilet (6) - 1 freq apocalyptic (6) - 6 freq dialectic (6) - 1 freq plettie (6) - 1 freq septic (6) - 3 freq pleatit (6) - 3 freq repeatic (6) - 1 freq apoligetic (6) - 1 freq apologetic (6) - 11 freq politico (6) - 2 freq plentie (6) - 5 freq pulpit (6) - 9 freq poetic (6) - 35 freq plettin (6) - 1 freq poleetics (6) - 1 freq aplentie (6) - 2 freq |
SoundEx code - E141 evolves - 1 freq epileptic - 4 freq epilepsy - 5 freq eabbi-labbi - 1 freq evolved - 9 freq evolve - 7 freq evolvin - 1 freq eeyplvxu - 1 freq |
MetaPhone code - EPLPTK epileptic - 4 freq |
EPILEPTIC |
| Time to execute Levenshtein function - 0.509640 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.804030 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.081320 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.083520 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.001208 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. |