| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eyeliners (0) - 1 freq eyeliner (1) - 3 freq erlines (3) - 2 freq ceelinders (3) - 1 freq delivers (3) - 2 freq eyewitness (3) - 1 freq liners (3) - 2 freq eyelids (3) - 10 freq lipliners (3) - 1 freq dubliners (3) - 2 freq eyeless (3) - 1 freq ex-miners (3) - 1 freq evenliness (3) - 1 freq veesiters (4) - 2 freq englanders (4) - 1 freq eines (4) - 3 freq eyelashes (4) - 8 freq jiners (4) - 6 freq meiner (4) - 2 freq menners (4) - 2 freq salineps (4) - 3 freq irelanders (4) - 1 freq ugliness (4) - 1 freq deniers (4) - 4 freq einer (4) - 1 freq |
eyeliners (0) - 1 freq eyeliner (2) - 3 freq liners (3) - 2 freq loners (4) - 1 freq lingers (5) - 5 freq leipers (5) - 2 freq linens (5) - 1 freq cleaners (5) - 8 freq line's (5) - 2 freq deniers (5) - 4 freq miners (5) - 41 freq eilins (5) - 4 freq elyers (5) - 1 freq yolkers (5) - 1 freq yealins (5) - 1 freq eilers (5) - 1 freq deeners (5) - 1 freq mainers (5) - 2 freq jyners (5) - 26 freq joiners (5) - 7 freq elaine's (5) - 1 freq livers (5) - 1 freq learners (5) - 6 freq openers (5) - 2 freq lines (5) - 222 freq |
SoundEx code - E456 eyeliner - 3 freq elmer - 2 freq eyeliners - 1 freq eleanor - 10 freq elmar - 2 freq eleanordacq - 1 freq ellenrwilson - 1 freq |
MetaPhone code - EYLNRS eyeliners - 1 freq |
EYELINERS |
| Time to execute Levenshtein function - 0.300396 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.465119 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.032663 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.040801 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.001071 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. |