| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evaded (0) - 1 freq evades (1) - 2 freq evade (1) - 2 freq eader (2) - 1 freq ended (2) - 70 freq vader (2) - 3 freq vaned (2) - 1 freq erawed (2) - 1 freq elided (2) - 1 freq elated (2) - 3 freq shaded (2) - 4 freq eynded (2) - 1 freq erased (2) - 4 freq eased (2) - 3 freq faded (2) - 16 freq graded (2) - 3 freq evened (2) - 1 freq vanded (2) - 1 freq waded (2) - 6 freq invaded (2) - 4 freq headed (2) - 38 freq loaded (2) - 22 freq laded (2) - 1 freq eroded (2) - 2 freq beaded (2) - 1 freq |
evaded (0) - 1 freq evade (2) - 2 freq evades (2) - 2 freq loaded (3) - 22 freq laded (3) - 1 freq invaded (3) - 4 freq vanded (3) - 1 freq eroded (3) - 2 freq waded (3) - 6 freq jaded (3) - 3 freq avoided (3) - 5 freq exuded (3) - 2 freq goaded (3) - 1 freq evened (3) - 1 freq beaded (3) - 1 freq headed (3) - 38 freq elided (3) - 1 freq vaned (3) - 1 freq avodd (3) - 1 freq ended (3) - 70 freq vodd (3) - 2 freq vader (3) - 3 freq faded (3) - 16 freq eynded (3) - 1 freq varied (4) - 8 freq |
SoundEx code - E133 evitit - 2 freq evytit - 1 freq eftitnune - 1 freq epithet - 2 freq evaded - 1 freq eppatite - 1 freq |
MetaPhone code - EFTT evitit - 2 freq evytit - 1 freq evaded - 1 freq |
EVADED |
| Time to execute Levenshtein function - 0.244092 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.420148 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.029353 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.039217 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.000922 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. |