| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| errol (0) - 2 freq error (1) - 16 freq erroll (1) - 1 freq enrol (1) - 1 freq ergo (2) - 1 freq euros (2) - 7 freq ervo (2) - 2 freq arrow (2) - 9 freq terrel (2) - 6 freq errin (2) - 1 freq erred (2) - 1 freq epril (2) - 1 freq ecrml (2) - 2 freq errs (2) - 1 freq eiron (2) - 1 freq eedol (2) - 1 freq rool (2) - 1 freq earl (2) - 31 freq erll (2) - 1 freq errows (2) - 1 freq carol (2) - 62 freq petrol (2) - 36 freq terror (2) - 40 freq merro (2) - 1 freq nerrow (2) - 1 freq |
errol (0) - 2 freq orral (2) - 6 freq enrol (2) - 1 freq error (2) - 16 freq erroll (2) - 1 freq ersel (3) - 36 freq carol (3) - 62 freq earl (3) - 31 freq erll (3) - 1 freq errza (3) - 2 freq erran (3) - 3 freq erra (3) - 3 freq rool (3) - 1 freq errour (3) - 1 freq drool (3) - 6 freq err (3) - 40 freq arrow (3) - 9 freq erred (3) - 1 freq errin (3) - 1 freq epril (3) - 1 freq terrel (3) - 6 freq rural (3) - 28 freq errs (3) - 1 freq reuril (3) - 1 freq ariel (4) - 5 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 |
ERROL |
| Time to execute Levenshtein function - 0.230292 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.355066 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.027796 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.040737 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.000917 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. |