| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evidently (0) - 25 freq eidently (1) - 16 freq evidents (2) - 1 freq eydently (2) - 22 freq eminently (2) - 2 freq evident (2) - 12 freq evidence (3) - 151 freq violently (3) - 16 freq pairently (3) - 1 freq eident (3) - 44 freq silently (3) - 32 freq ardently (3) - 1 freq evidenced (3) - 1 freq reverently (3) - 4 freq eidentlie (3) - 3 freq evenly (3) - 5 freq suddently (3) - 50 freq raicently (3) - 20 freq accidently (3) - 1 freq dently (3) - 1 freq stridently (3) - 1 freq decidetly (3) - 1 freq expertly (4) - 5 freq suddenty (4) - 40 freq quietly (4) - 61 freq |
evidently (0) - 25 freq eidently (2) - 16 freq evident (3) - 12 freq eydently (3) - 22 freq evidents (3) - 1 freq ardently (4) - 1 freq dently (4) - 1 freq eidentlie (4) - 3 freq violently (4) - 16 freq eminently (4) - 2 freq accidently (5) - 1 freq obediently (5) - 4 freq dentily (5) - 1 freq eydentlie (5) - 17 freq raicently (5) - 20 freq avedents (5) - 1 freq vacantly (5) - 1 freq eident (5) - 44 freq suddently (5) - 50 freq evidenced (5) - 1 freq silently (5) - 32 freq pairently (5) - 1 freq evidence (5) - 151 freq reverently (5) - 4 freq evenly (5) - 5 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 - EFTNTL evidently - 25 freq |
EVIDENTLY |
| Time to execute Levenshtein function - 0.205348 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.352293 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.027429 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.038952 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.000805 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. |