| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eliot (0) - 1 freq lliot (1) - 1 freq eliot' (1) - 1 freq ediot (1) - 1 freq elliot (1) - 17 freq ellot (1) - 1 freq lint (2) - 17 freq clift (2) - 3 freq eliud (2) - 3 freq llion (2) - 57 freq eliot's (2) - 1 freq elite (2) - 22 freq alist (2) - 2 freq idiot (2) - 24 freq eit (2) - 644 freq blirt (2) - 8 freq telit (2) - 1 freq blist (2) - 32 freq helios (2) - 5 freq elid (2) - 2 freq 'lot (2) - 1 freq elide (2) - 1 freq litt (2) - 2 freq flot (2) - 2 freq elicit (2) - 1 freq |
eliot (0) - 1 freq aloot (2) - 1 freq elite (2) - 22 freq liet (2) - 4 freq lit (2) - 283 freq lot (2) - 800 freq alot (2) - 18 freq loot (2) - 9 freq elt (2) - 2 freq elliot (2) - 17 freq ellot (2) - 1 freq ediot (2) - 1 freq eliot' (2) - 1 freq lliot (2) - 1 freq eediot (3) - 5 freq eidiot (3) - 1 freq oolit (3) - 2 freq aeiot (3) - 1 freq elic (3) - 2 freq elroy (3) - 2 freq 'lit (3) - 2 freq clot (3) - 1 freq elied (3) - 1 freq elect (3) - 9 freq ekit (3) - 1 freq |
SoundEx code - E430 eild - 17 freq eld - 30 freq eauld - 1 freq eilidh - 2 freq elite - 22 freq ee-lid - 2 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 - 2 freq elite - 22 freq ee-lid - 2 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 |
ELIOT |
| Time to execute Levenshtein function - 0.201742 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.347388 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.028177 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.037472 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.000905 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. |