| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elliot (0) - 17 freq eliot (1) - 1 freq lliot (1) - 1 freq ellot (1) - 1 freq elliott (1) - 2 freq mellit (2) - 4 freq alloot (2) - 4 freq ellon (2) - 19 freq llion (2) - 57 freq eediot (2) - 5 freq ellis (2) - 2 freq eidiot (2) - 1 freq enlist (2) - 1 freq yellit (2) - 1 freq eliot' (2) - 1 freq felloot (2) - 1 freq elliot's (2) - 2 freq cellist (2) - 1 freq ellie (2) - 7 freq ediot (2) - 1 freq eliot's (3) - 1 freq clairt (3) - 5 freq fiot (3) - 1 freq likt (3) - 9 freq riot (3) - 30 freq |
elliot (0) - 17 freq ellot (1) - 1 freq lliot (1) - 1 freq alloot (2) - 4 freq yellit (2) - 1 freq elliott (2) - 2 freq eliot (2) - 1 freq felloot (3) - 1 freq yellt (3) - 4 freq yallit (3) - 1 freq allyat (3) - 2 freq ellie (3) - 7 freq allout (3) - 2 freq ellon (3) - 19 freq llion (3) - 57 freq ellis (3) - 2 freq mellit (3) - 4 freq lilt (3) - 22 freq callit (4) - 3 freq luift (4) - 3 freq alot (4) - 18 freq eloiset (4) - 2 freq zealot (4) - 3 freq relait (4) - 1 freq geelit (4) - 1 freq |
SoundEx code - E430 eild - 17 freq eld - 30 freq eauld - 1 freq eilidh - 1 freq ee-lid - 2 freq elite - 21 freq 'elite' - 1 freq eould - 2 freq elied - 1 freq eliud - 3 freq elid - 2 freq eld - 2 freq elt - 2 freq eyelid - 2 freq elude - 1 freq elliot - 17 freq eold - 1 freq ealled - 1 freq eliot - 1 freq eelie't - 3 freq eliot' - 1 freq ehield - 1 freq elliott - 2 freq ellot - 1 freq elide - 1 freq |
MetaPhone code - ELT eild - 17 freq eld - 30 freq eauld - 1 freq eilidh - 1 freq ee-lid - 2 freq elite - 21 freq 'elite' - 1 freq eould - 2 freq elied - 1 freq eliud - 3 freq elid - 2 freq eld - 2 freq elt - 2 freq elude - 1 freq elliot - 17 freq eold - 1 freq ealled - 1 freq eliot - 1 freq eelie't - 3 freq eliot' - 1 freq elliott - 2 freq ellot - 1 freq elide - 1 freq |
ELLIOT |
| Time to execute Levenshtein function - 0.187923 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.332258 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.029943 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.037656 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.000890 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. |