| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| epple (0) - 13 freq epples (1) - 10 freq apple (1) - 32 freq erle (2) - 4 freq ripple (2) - 7 freq eggle (2) - 2 freq exile (2) - 20 freq people (2) - 568 freq epl (2) - 9 freq applee (2) - 1 freq spile (2) - 11 freq elphe (2) - 1 freq semple (2) - 24 freq empie (2) - 25 freq nipple (2) - 3 freq cupple (2) - 2 freq pile (2) - 110 freq ebble (2) - 1 freq apply (2) - 37 freq pole (2) - 45 freq ettle (2) - 188 freq ppe (2) - 3 freq epely (2) - 1 freq eppy (2) - 1 freq eedle (2) - 1 freq |
epple (0) - 13 freq apple (1) - 32 freq applee (2) - 1 freq aipple (2) - 102 freq apply (2) - 37 freq people (2) - 568 freq epples (2) - 10 freq peeple (2) - 3 freq ppl (2) - 3 freq ypzle (3) - 1 freq supple (3) - 6 freq topple (3) - 1 freq papple (3) - 1 freq kipple (3) - 2 freq ample (3) - 9 freq pele (3) - 17 freq sapple (3) - 1 freq apples (3) - 10 freq aple (3) - 2 freq pule (3) - 4 freq ple (3) - 1 freq dapple (3) - 2 freq tipple (3) - 3 freq aiple (3) - 5 freq pale (3) - 86 freq |
SoundEx code - E140 evil - 89 freq epple - 13 freq ebola - 1 freq eeevilly - 1 freq eiffel - 2 freq eivill - 1 freq evil' - 1 freq evill - 1 freq €˜evil - 2 freq ebble - 1 freq epl - 9 freq efl - 2 freq epely - 1 freq |
MetaPhone code - EPL epple - 13 freq epl - 9 freq epely - 1 freq |
EPPLE |
| Time to execute Levenshtein function - 0.183204 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.363150 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.028641 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.041029 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.000785 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. |