| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elisha (0) - 1 freq belisha (1) - 1 freq eliska (1) - 1 freq trisha (2) - 9 freq plish (2) - 2 freq eilish (2) - 1 freq elise (2) - 1 freq clish (2) - 1 freq relish (2) - 7 freq lisa (2) - 16 freq delish (2) - 2 freq geisha (2) - 1 freq lithca (3) - 1 freq pishy (3) - 8 freq egoista (3) - 1 freq 'fish (3) - 2 freq hish (3) - 1 freq flusht (3) - 4 freq wish (3) - 376 freq enosh (3) - 3 freq glesga (3) - 107 freq blichan (3) - 1 freq verish (3) - 1 freq eeight (3) - 1 freq glisk (3) - 72 freq |
elisha (0) - 1 freq eilish (2) - 1 freq eliska (2) - 1 freq belisha (2) - 1 freq geisha (3) - 1 freq delish (3) - 2 freq lush (3) - 13 freq leish (3) - 2 freq lisa (3) - 16 freq losh (3) - 30 freq relish (3) - 7 freq lash (3) - 17 freq plish (3) - 2 freq elise (3) - 1 freq clish (3) - 1 freq flashy (4) - 4 freq weish (4) - 4 freq flushy (4) - 1 freq emosh (4) - 1 freq lisboa (4) - 1 freq elaiss (4) - 1 freq flush (4) - 26 freq plashy (4) - 1 freq lith (4) - 1 freq plush (4) - 6 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 - ELX elisha - 1 freq eilish - 1 freq |
ELISHA |
| Time to execute Levenshtein function - 0.210948 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.385490 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.035353 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.038158 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.000923 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. |