| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eveidence (0) - 1 freq evidence (1) - 151 freq eevidence (2) - 1 freq evidenced (2) - 1 freq lvidence (2) - 1 freq avidence (2) - 2 freq eydence (3) - 1 freq reverence (3) - 10 freq residence (3) - 17 freq avoidance (3) - 4 freq emergence (3) - 4 freq evidents (3) - 1 freq seilence (3) - 6 freq accidence (3) - 1 freq veelence (3) - 1 freq eminence (3) - 1 freq credence (3) - 4 freq evident (3) - 13 freq impidence (3) - 8 freq raisidence (4) - 1 freq diligence (4) - 1 freq eleiventh (4) - 1 freq impeedence (4) - 1 freq revedere (4) - 1 freq euidnae (4) - 3 freq |
eveidence (0) - 1 freq evidence (1) - 151 freq avidence (2) - 2 freq eevidence (2) - 1 freq evidenced (3) - 1 freq avoidance (3) - 4 freq lvidence (3) - 1 freq evident (4) - 13 freq eydence (4) - 1 freq veelence (4) - 1 freq impidence (5) - 8 freq violence (5) - 37 freq obedience (5) - 1 freq audience (5) - 94 freq owdience (5) - 10 freq evytance (5) - 1 freq cadence (5) - 2 freq eminence (5) - 1 freq credence (5) - 4 freq evidents (5) - 1 freq aadience (5) - 5 freq residence (5) - 17 freq reverence (5) - 10 freq guidance (5) - 42 freq accidence (5) - 1 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 - EFTNS evidence - 151 freq eevidence - 1 freq eveidence - 1 freq evytance - 1 freq |
EVEIDENCE |
| Time to execute Levenshtein function - 0.691316 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.781138 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.030071 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.071762 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.000877 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. |