| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eilses (0) - 1 freq eilse (1) - 1 freq elses (1) - 1 freq pisses (2) - 4 freq sinses (2) - 2 freq biles (2) - 14 freq eirse (2) - 2 freq eise (2) - 2 freq elves (2) - 10 freq oiles (2) - 1 freq else's (2) - 29 freq biases (2) - 1 freq miles (2) - 173 freq wisses (2) - 4 freq giles (2) - 9 freq fisses (2) - 1 freq eilers (2) - 1 freq erses (2) - 23 freq eilds (2) - 2 freq files (2) - 111 freq eile (2) - 1 freq rises (2) - 42 freq eiss (2) - 31 freq eeses (2) - 1 freq uises (2) - 36 freq |
eilses (0) - 1 freq elses (1) - 1 freq eilse (2) - 1 freq iles (3) - 3 freq airses (3) - 3 freq eilins (3) - 4 freq else' (3) - 1 freq aises (3) - 1 freq eeses (3) - 1 freq uises (3) - 36 freq uisses (3) - 2 freq wises (3) - 1 freq pulses (3) - 3 freq ilse (3) - 1 freq lss (3) - 1 freq liss (3) - 2 freq loses (3) - 6 freq else (3) - 743 freq yisses (3) - 2 freq eiss (3) - 31 freq lilies (3) - 19 freq eases (3) - 1 freq looses (3) - 2 freq elves (3) - 10 freq erses (3) - 23 freq |
SoundEx code - E422 else's - 29 freq elegies - 3 freq elsie's - 5 freq eyelashes - 8 freq elija's - 1 freq eelashes - 4 freq elses - 1 freq elegaic - 2 freq eulogisit - 1 freq elses - 2 freq eilses - 1 freq elwikazz - 1 freq elskass - 1 freq |
MetaPhone code - ELSS else's - 29 freq elsie's - 5 freq elses - 1 freq elses - 2 freq eilses - 1 freq |
EILSES |
| Time to execute Levenshtein function - 0.271946 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.505197 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.032344 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.042236 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.000889 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. |