| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evident (0) - 13 freq evidents (1) - 1 freq eident (1) - 47 freq evidently (2) - 25 freq event (2) - 103 freq wident (2) - 2 freq resident (2) - 16 freq trident (2) - 18 freq reident (2) - 2 freq evidence (2) - 151 freq eydent (2) - 20 freq ensident (2) - 1 freq eensident (3) - 1 freq dividen (3) - 1 freq avedents (3) - 1 freq deviant (3) - 1 freq reiden (3) - 1 freq leviet (3) - 1 freq elide (3) - 1 freq waikent (3) - 2 freq maiment (3) - 2 freq lenient (3) - 2 freq tridents (3) - 1 freq client (3) - 2 freq raicent (3) - 34 freq |
evident (0) - 13 freq eident (2) - 47 freq evidents (2) - 1 freq evidence (3) - 151 freq reident (3) - 2 freq eydent (3) - 20 freq event (3) - 103 freq wident (3) - 2 freq evidently (3) - 25 freq vidn (4) - 1 freq eevidence (4) - 1 freq violent (4) - 18 freq ladent (4) - 1 freq didnt (4) - 3 freq ardent (4) - 2 freq rodent (4) - 4 freq avidence (4) - 2 freq diidnt (4) - 1 freq eveidence (4) - 1 freq avoidet (4) - 1 freq dent (4) - 4 freq vent (4) - 6 freq vdett (4) - 1 freq ensident (4) - 1 freq resident (4) - 16 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 - EFTNT evident - 13 freq eighteent - 1 freq |
EVIDENT |
| Time to execute Levenshtein function - 0.317411 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.565974 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.027855 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.069815 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.000937 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. |