| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| else (0) - 743 freq elsie (1) - 62 freq ilse (1) - 1 freq elke (1) - 3 freq else' (1) - 1 freq erse (1) - 270 freq ese (1) - 2 freq els (1) - 11 freq elise (1) - 1 freq eise (1) - 2 freq etse (1) - 1 freq eese (1) - 107 freq ease (1) - 94 freq elie (1) - 1 freq alse (1) - 8 freq eilse (1) - 1 freq ense (1) - 15 freq elses (1) - 1 freq sloe (2) - 1 freq elren (2) - 1 freq evie (2) - 8 freq elt (2) - 2 freq kelsi (2) - 3 freq alce (2) - 1 freq lst (2) - 1 freq |
else (0) - 743 freq elise (1) - 1 freq alse (1) - 8 freq els (1) - 11 freq eilse (1) - 1 freq ilse (1) - 1 freq elsie (1) - 62 freq leise (2) - 1 freq ils (2) - 1 freq ls (2) - 6 freq olso (2) - 1 freq als (2) - 27 freq alsa (2) - 1 freq lose (2) - 100 freq lease (2) - 14 freq eyls (2) - 3 freq alsae (2) - 9 freq erse (2) - 270 freq eels (2) - 11 freq eise (2) - 2 freq elke (2) - 3 freq else' (2) - 1 freq ese (2) - 2 freq elses (2) - 1 freq etse (2) - 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 - ELS else - 743 freq elsie - 62 freq eels - 11 freq els - 11 freq ellis - 3 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 eilse - 1 freq elouise - 9 freq |
ELSE else - 743 freq |
| Time to execute Levenshtein function - 0.231737 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.373603 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.029430 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.040652 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.001262 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. |