| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elsie (0) - 62 freq eisie (1) - 2 freq 'elsie (1) - 9 freq elkie (1) - 1 freq else (1) - 723 freq easie (1) - 4 freq elie (1) - 1 freq ellie (1) - 7 freq ilie (2) - 1 freq versie (2) - 1 freq elrig (2) - 9 freq posie (2) - 1 freq ellis (2) - 2 freq kellie (2) - 1 freq oldie (2) - 2 freq eyrie (2) - 6 freq eese (2) - 106 freq nellie (2) - 42 freq ense (2) - 15 freq eeside (2) - 1 freq sie (2) - 41 freq envie (2) - 2 freq eesee (2) - 3 freq elvis (2) - 11 freq ermie (2) - 1 freq |
elsie (0) - 62 freq else (1) - 723 freq ilse (2) - 1 freq alsae (2) - 9 freq elise (2) - 1 freq alse (2) - 8 freq els (2) - 11 freq eilse (2) - 1 freq 'elsie (2) - 9 freq eisie (2) - 2 freq ellie (2) - 7 freq elkie (2) - 1 freq elie (2) - 1 freq easie (2) - 4 freq peesie (3) - 1 freq ease (3) - 91 freq elid (3) - 2 freq illie (3) - 2 freq cosie (3) - 22 freq alsua (3) - 1 freq elied (3) - 1 freq alkie (3) - 3 freq ollie (3) - 7 freq josie (3) - 18 freq elic (3) - 2 freq |
SoundEx code - E420 else - 723 freq elsie - 62 freq eels - 11 freq elegie - 3 freq els - 11 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 elk - 5 freq elaiss - 1 freq elks - 2 freq €œelk - 1 freq eyeless - 1 freq €™else - 1 freq eilish - 1 freq elxy - 1 freq ellis - 2 freq eilse - 1 freq elke - 3 freq elc - 5 freq elouise - 9 freq elkie - 1 freq |
MetaPhone code - ELS else - 723 freq elsie - 62 freq eels - 11 freq els - 11 freq aeolus - 2 freq ella's - 10 freq 'elsie - 9 freq 'elise - 1 freq elise - 1 freq eyls - 3 freq else' - 1 freq €œelsie - 1 freq elaiss - 1 freq €™else - 1 freq ellis - 2 freq eilse - 1 freq elouise - 9 freq |
ELSIE |
| Time to execute Levenshtein function - 0.193547 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.335888 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.027212 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.036436 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.000846 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. |