| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| epidemics (0) - 1 freq epidemic (1) - 8 freq polemics (3) - 2 freq academics (3) - 22 freq endemic (3) - 3 freq piecies (4) - 1 freq picnics (4) - 7 freq eitems (4) - 2 freq pieties (4) - 1 freq academies (4) - 1 freq eidein (4) - 1 freq sidelins (4) - 4 freq eemis (4) - 12 freq goidelic (4) - 3 freq spider's (4) - 1 freq academic (4) - 69 freq podemos (4) - 4 freq epodes (4) - 1 freq economics (4) - 13 freq academicus (4) - 1 freq enemies (4) - 37 freq evidents (4) - 1 freq epileptic (4) - 4 freq extremis (4) - 2 freq inemies (4) - 3 freq |
epidemics (0) - 1 freq epidemic (2) - 8 freq academics (4) - 22 freq polemics (4) - 2 freq podemos (5) - 4 freq acadeemics (5) - 1 freq academicus (5) - 1 freq endemic (5) - 3 freq academic (6) - 69 freq pandemic (6) - 40 freq epodes (6) - 1 freq economics (6) - 13 freq academies (6) - 1 freq picnics (6) - 7 freq pendemic (6) - 1 freq piecies (6) - 1 freq aicademic (7) - 2 freq undemous (7) - 6 freq eidioms (7) - 2 freq academe's (7) - 1 freq demos (7) - 2 freq paulmies (7) - 1 freq demons (7) - 36 freq modem's (7) - 1 freq premises (7) - 14 freq |
SoundEx code - E135 evidence - 151 freq evident - 13 freq evitin - 4 freq eevidence - 1 freq evidently - 25 freq epitome - 7 freq evidents - 1 freq epidemic - 8 freq eftemeen - 1 freq eveidence - 1 freq evytance - 1 freq eftimin - 1 freq eftinoon - 1 freq epidemics - 1 freq eppptwhn - 1 freq eoftn - 1 freq evidenced - 1 freq epidemiology - 1 freq |
MetaPhone code - EPTMKS epidemics - 1 freq |
EPIDEMICS |
| Time to execute Levenshtein function - 0.286788 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.550000 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.071788 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.037733 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.000872 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. |