Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
elid (0) - 2 freq eid (1) - 4 freq eliud (1) - 3 freq blid (1) - 9 freq elide (1) - 1 freq elie (1) - 1 freq eli (1) - 4 freq euid (1) - 4 freq eld (1) - 30 freq elied (1) - 1 freq egid (1) - 1 freq lid (1) - 71 freq elic (1) - 2 freq slid (1) - 32 freq eard (2) - 1 freq glim (2) - 8 freq ali (2) - 162 freq elo (2) - 2 freq held (2) - 505 freq ilie (2) - 1 freq ilin (2) - 1 freq roid (2) - 1 freq sklid (2) - 1 freq neid (2) - 1 freq eold (2) - 1 freq |
elid (0) - 2 freq eld (1) - 30 freq lid (1) - 71 freq elide (1) - 1 freq elied (1) - 1 freq eliud (1) - 3 freq lad (2) - 548 freq yeld (2) - 2 freq eold (2) - 1 freq ald (2) - 14 freq ld (2) - 3 freq lied (2) - 15 freq laid (2) - 269 freq leid (2) - 1517 freq lido (2) - 2 freq eyelid (2) - 2 freq iled (2) - 1 freq iliad (2) - 3 freq lod (2) - 2 freq old (2) - 178 freq euid (2) - 4 freq eli (2) - 4 freq egid (2) - 1 freq led (2) - 245 freq slid (2) - 32 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 |
ELID |
Time to execute Levenshtein function - 0.177451 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.331576 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.029026 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.043255 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.000825 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. |