| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elton (0) - 2 freq elon (1) - 1 freq eton (1) - 7 freq eltin (1) - 1 freq eaton (1) - 1 freq ellon (1) - 19 freq eldon (1) - 1 freq melton (1) - 1 freq keaton (2) - 1 freq bolton (2) - 2 freq etin (2) - 10 freq elo (2) - 2 freq ton (2) - 17 freq baton (2) - 3 freq alson (2) - 1 freq pilton (2) - 1 freq cloon (2) - 8 freq luton (2) - 2 freq felon (2) - 2 freq lon (2) - 2 freq aston (2) - 4 freq eliot (2) - 1 freq ellons (2) - 1 freq eiron (2) - 1 freq meltin (2) - 24 freq |
elton (0) - 2 freq eltin (1) - 1 freq luton (2) - 2 freq elation (2) - 3 freq melton (2) - 1 freq eldon (2) - 1 freq elon (2) - 1 freq eton (2) - 7 freq eaton (2) - 1 freq ellon (2) - 19 freq ectin (3) - 1 freq eatin (3) - 154 freq elted (3) - 1 freq beltin (3) - 22 freq ellan (3) - 2 freq fulton (3) - 5 freq calton (3) - 10 freq llion (3) - 57 freq melten (3) - 3 freq beaton (3) - 35 freq wilton (3) - 1 freq teuton (3) - 2 freq elren (3) - 1 freq heaton (3) - 1 freq afton (3) - 3 freq |
SoundEx code - E435 elation - 3 freq eildon - 3 freq eouldna - 1 freq eltin - 1 freq elton - 2 freq eildons - 1 freq eldon - 1 freq eldin - 3 freq |
MetaPhone code - ELTN eildon - 3 freq eouldna - 1 freq eltin - 1 freq elton - 2 freq eldon - 1 freq eldin - 3 freq |
ELTON |
| Time to execute Levenshtein function - 0.189788 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.361960 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.030415 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.041723 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.000941 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. |