| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| erly (0) - 3 freq eraly (1) - 1 freq ery (1) - 15 freq early (1) - 366 freq ely (1) - 1 freq ferly (1) - 20 freq eely (1) - 2 freq aerly (1) - 19 freq erll (1) - 1 freq ermy (1) - 2 freq erle (1) - 4 freq erdly (1) - 1 freq erey (1) - 1 freq tray (2) - 48 freq ray (2) - 17 freq wery (2) - 1 freq yearly (2) - 10 freq arty (2) - 1 freq ell (2) - 1 freq engy (2) - 2 freq furly (2) - 10 freq gray (2) - 87 freq rlq (2) - 1 freq fly (2) - 183 freq ella (2) - 26 freq |
erly (0) - 3 freq erle (1) - 4 freq early (1) - 366 freq aerly (1) - 19 freq eraly (1) - 1 freq airly (2) - 20 freq rl (2) - 2 freq realy (2) - 2 freq yerl (2) - 1 freq eerily (2) - 1 freq reely (2) - 9 freq rely (2) - 16 freq irlo (2) - 1 freq roly (2) - 8 freq earl (2) - 31 freq url (2) - 1 freq yeirly (2) - 2 freq ermy (2) - 2 freq erdly (2) - 1 freq erey (2) - 1 freq eely (2) - 2 freq ferly (2) - 20 freq ery (2) - 15 freq ely (2) - 1 freq yearly (2) - 10 freq |
SoundEx code - E640 early - 366 freq earl - 31 freq eerily - 1 freq earlie - 7 freq errol - 2 freq erll - 1 freq eraly - 1 freq erroll - 1 freq erly - 3 freq erle - 4 freq |
MetaPhone code - ERL early - 366 freq aerlie - 10 freq earl - 31 freq eerily - 1 freq earlie - 7 freq aerly - 19 freq errol - 2 freq aeriel - 1 freq erll - 1 freq eraly - 1 freq aerial - 5 freq erroll - 1 freq erly - 3 freq erle - 4 freq |
ERLY |
| Time to execute Levenshtein function - 0.183333 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.336278 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.027537 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.037590 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.000938 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. |