| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| easier (0) - 111 freq easjer (1) - 1 freq easie (1) - 4 freq easter (1) - 41 freq earlier (2) - 106 freq eyster (2) - 2 freq watier (2) - 1 freq easel (2) - 1 freq aesier (2) - 13 freq sasser (2) - 11 freq eesyer (2) - 1 freq greasier (2) - 1 freq aisier (2) - 12 freq easterd (2) - 1 freq rapier (2) - 2 freq peasie (2) - 1 freq earrier (2) - 1 freq easles (2) - 2 freq napier (2) - 25 freq elsie (2) - 62 freq easin (2) - 11 freq efier (2) - 1 freq aser (2) - 1 freq faster (2) - 77 freq casie (2) - 3 freq |
easier (0) - 111 freq eesyer (2) - 1 freq aisier (2) - 12 freq aser (2) - 1 freq eser (2) - 1 freq aesier (2) - 13 freq easjer (2) - 1 freq easie (2) - 4 freq easter (2) - 41 freq eader (3) - 1 freq busier (3) - 3 freq syer (3) - 1 freq sair (3) - 772 freq eisie (3) - 2 freq eager (3) - 27 freq taser (3) - 3 freq asher (3) - 1 freq aster (3) - 1 freq eater (3) - 2 freq ser (3) - 19 freq user (3) - 3 freq yaiser (3) - 3 freq sir (3) - 356 freq seer (3) - 39 freq easily (3) - 59 freq |
SoundEx code - E260 eager - 27 freq easier - 111 freq eesyer - 1 freq easjer - 1 freq egeria - 1 freq eezer - 1 freq ecairry - 1 freq ezra - 3 freq ex-chair - 1 freq eqr - 2 freq eser - 1 freq echr - 1 freq eeger - 1 freq |
MetaPhone code - ESR easier - 111 freq aesir - 4 freq eezer - 1 freq aesier - 13 freq ezra - 3 freq eser - 1 freq |
EASIER |
| Time to execute Levenshtein function - 0.182114 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.339250 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.026934 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.037178 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.000800 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. |