Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eyelid (0) - 2 freq eyelids (1) - 10 freq eyein (2) - 3 freq eyewis (2) - 5 freq elid (2) - 2 freq eelids (2) - 2 freq eelie (2) - 1 freq ee-lid (2) - 2 freq eyed (2) - 21 freq yeld (2) - 2 freq byeleid (2) - 2 freq ecuid (3) - 3 freq ettld (3) - 1 freq celic (3) - 1 freq eelyin (3) - 1 freq ellis (3) - 3 freq wyed (3) - 2 freq reeled (3) - 6 freq eejit (3) - 71 freq reelin (3) - 16 freq eauld (3) - 1 freq exemin (3) - 1 freq esel (3) - 2 freq jeelin (3) - 5 freq dreid (3) - 51 freq |
eyelid (0) - 2 freq yeld (2) - 2 freq eyelids (2) - 10 freq elid (2) - 2 freq leid (3) - 1536 freq eliud (3) - 3 freq eould (3) - 2 freq eld (3) - 30 freq elide (3) - 1 freq ayld (3) - 1 freq elied (3) - 1 freq eauld (3) - 1 freq eold (3) - 1 freq lid (3) - 71 freq eyed (3) - 21 freq ee-lid (3) - 2 freq eelie (3) - 1 freq eelids (3) - 2 freq byeleid (3) - 2 freq eild (3) - 17 freq yield (3) - 16 freq neid (4) - 1 freq meid (4) - 4 freq yelp (4) - 20 freq egid (4) - 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 - EYLT eyelid - 2 freq |
EYELID |
Time to execute Levenshtein function - 0.200681 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.453547 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.060337 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.037564 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.000935 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. |