Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eyeless (0) - 1 freq eyeweys (2) - 1 freq endless (2) - 52 freq rueless (2) - 1 freq wyreless (2) - 4 freq enless (2) - 12 freq daeless (2) - 4 freq eeseless (2) - 6 freq useless (2) - 36 freq ageless (2) - 5 freq eyelids (2) - 10 freq teylers (3) - 1 freq eyebas (3) - 1 freq bless (3) - 44 freq ryegress (3) - 1 freq hameless (3) - 17 freq seckless (3) - 1 freq erles (3) - 1 freq usless (3) - 1 freq guiless (3) - 1 freq yeese (3) - 12 freq yell's (3) - 1 freq jagless (3) - 3 freq eess (3) - 1 freq eeses (3) - 1 freq |
eyeless (0) - 1 freq eeseless (3) - 6 freq useless (3) - 36 freq ageless (3) - 5 freq daeless (3) - 4 freq less (3) - 552 freq eyelids (3) - 10 freq enless (3) - 12 freq rueless (3) - 1 freq aless (3) - 26 freq eilses (4) - 1 freq giless (4) - 4 freq uisless (4) - 6 freq lass (4) - 496 freq elaiss (4) - 1 freq eilers (4) - 1 freq deualess (4) - 1 freq gless (4) - 395 freq liss (4) - 2 freq yelps (4) - 5 freq yearless (4) - 1 freq lss (4) - 1 freq airless (4) - 1 freq yellas (4) - 4 freq aimless (4) - 1 freq |
SoundEx code - E420 else - 743 freq elsie - 62 freq eels - 11 freq elegie - 3 freq els - 11 freq ellis - 3 freq elk - 6 freq elijah - 25 freq elisha - 1 freq ella's - 10 freq 'elsie - 9 freq 'elise - 1 freq elise - 1 freq elic - 2 freq eyls - 3 freq eulogy - 4 freq else' - 1 freq eliska - 1 freq elegy - 6 freq eleck - 4 freq €˜elegy - 1 freq €œelsie - 1 freq elaiss - 1 freq elks - 2 freq €œelk - 1 freq eyeless - 1 freq €™else - 1 freq eilish - 1 freq elxy - 1 freq eilse - 1 freq elke - 3 freq elc - 5 freq elouise - 9 freq elkie - 1 freq |
MetaPhone code - EYLS eyeless - 1 freq |
EYELESS |
Time to execute Levenshtein function - 0.221690 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.419082 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.031309 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.037494 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.000899 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. |