| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evaluation (0) - 3 freq evacuation (1) - 1 freq evolution (2) - 10 freq evaluatin' (2) - 1 freq revelation (3) - 27 freq variation (3) - 18 freq exultation (3) - 1 freq evaluated (3) - 3 freq graduation (3) - 2 freq 'salvation (3) - 1 freq devolution (3) - 31 freq devastation (3) - 4 freq evacuatit (3) - 1 freq vacation (3) - 2 freq revolution (3) - 30 freq validation (3) - 2 freq evocation (3) - 1 freq elation (3) - 3 freq equation (3) - 5 freq evolutions (3) - 1 freq ejaculation (3) - 1 freq evaluate (3) - 1 freq retaliation (3) - 2 freq salvation (3) - 17 freq emasculation (4) - 1 freq |
evaluation (0) - 3 freq evolution (2) - 10 freq evacuation (2) - 1 freq evaluatin' (3) - 1 freq elation (4) - 3 freq evolutions (4) - 1 freq validation (4) - 2 freq revolution (4) - 30 freq volition (4) - 2 freq vaultin (4) - 1 freq vacation (4) - 2 freq evaluate (4) - 1 freq evocation (4) - 1 freq revelation (4) - 27 freq evaluated (4) - 3 freq devolution (4) - 31 freq variation (4) - 18 freq adulation (5) - 1 freq dilution (5) - 2 freq ablution (5) - 2 freq coalition (5) - 8 freq devolutioun (5) - 1 freq vocation (5) - 2 freq salutin (5) - 1 freq eveluin (5) - 1 freq |
SoundEx code - E143 epple-tree - 1 freq evolution - 10 freq evaluate - 1 freq e-bulletin - 1 freq epple-trees - 1 freq evaluation - 3 freq evaluated - 3 freq evaluatin' - 1 freq e-bluidy-nough - 1 freq evolutions - 1 freq |
MetaPhone code - EFLXN evolution - 10 freq evaluation - 3 freq |
EVALUATION |
| Time to execute Levenshtein function - 0.233657 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.409999 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.028290 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.037888 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.000995 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. |