| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evolutions (0) - 1 freq evolution (1) - 10 freq revolutions (1) - 4 freq resolutions (2) - 4 freq revolution (2) - 30 freq revolution' (2) - 1 freq solutions (2) - 20 freq devolution (2) - 31 freq solution (3) - 19 freq devolutioun (3) - 1 freq elocution (3) - 3 freq volition (3) - 2 freq revolutionise (3) - 1 freq emotions (3) - 31 freq resolution (3) - 19 freq evaluation (3) - 3 freq executions (3) - 11 freq revolutionar (3) - 1 freq reivolution (3) - 1 freq revelations (3) - 1 freq ablutions (3) - 2 freq l'evolution (3) - 1 freq devotions (3) - 4 freq evocation (3) - 1 freq exertions (4) - 2 freq |
evolutions (0) - 1 freq evolution (2) - 10 freq revolutions (2) - 4 freq solutions (3) - 20 freq ablutions (4) - 2 freq revolutionise (4) - 1 freq evaluation (4) - 3 freq volition (4) - 2 freq revelations (4) - 1 freq resolutions (4) - 4 freq revolution' (4) - 1 freq revolution (4) - 30 freq devolution (4) - 31 freq devotions (5) - 4 freq coalitions (5) - 1 freq evocation (5) - 1 freq relations (5) - 14 freq voluminous (5) - 1 freq evaluatin' (5) - 1 freq lotions (5) - 1 freq executions (5) - 11 freq dilations (5) - 1 freq reivolution (5) - 1 freq devolutioun (5) - 1 freq solution (5) - 19 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 - EFLXNS evolutions - 1 freq |
EVOLUTIONS |
| Time to execute Levenshtein function - 0.296578 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.458079 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.037114 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.055246 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.001149 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. |