| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evident (0) - 12 freq evidents (1) - 1 freq eident (1) - 44 freq reident (2) - 2 freq eydent (2) - 17 freq wident (2) - 2 freq resident (2) - 16 freq ensident (2) - 1 freq evidence (2) - 151 freq event (2) - 103 freq trident (2) - 18 freq evidently (2) - 25 freq evinin (3) - 1 freq impident (3) - 8 freq incident (3) - 28 freq vidn (3) - 1 freq maidment (3) - 2 freq lisent (3) - 1 freq einen (3) - 1 freq student (3) - 69 freq eevidence (3) - 1 freq vdett (3) - 1 freq eden (3) - 36 freq tridents (3) - 1 freq lenient (3) - 2 freq |
evident (0) - 12 freq eident (2) - 44 freq evidents (2) - 1 freq event (3) - 103 freq evidently (3) - 25 freq evidence (3) - 151 freq eydent (3) - 17 freq reident (3) - 2 freq wident (3) - 2 freq vdett (4) - 1 freq eevidence (4) - 1 freq dent (4) - 4 freq rodent (4) - 4 freq diidnt (4) - 1 freq avidence (4) - 2 freq ladent (4) - 1 freq violent (4) - 18 freq eveidence (4) - 1 freq trident (4) - 18 freq ensident (4) - 1 freq resident (4) - 16 freq didnt (4) - 3 freq vent (4) - 6 freq vidn (4) - 1 freq avoidet (4) - 1 freq |
SoundEx code - E135 evidence - 151 freq evident - 12 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 - EFTNT evident - 12 freq eighteent - 1 freq |
EVIDENT |
| Time to execute Levenshtein function - 0.220448 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.369334 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.027971 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.038007 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.000921 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. |