| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eeevilly (0) - 1 freq ceevilly (1) - 5 freq heevinly (2) - 2 freq reilly (3) - 3 freq devilry (3) - 2 freq deevils (3) - 11 freq ceevil (3) - 45 freq deevil (3) - 17 freq grevelly (3) - 1 freq reeeally (3) - 1 freq eivill (3) - 1 freq reekily (3) - 1 freq jeelly (3) - 1 freq seville (3) - 1 freq weevils (3) - 1 freq melville (3) - 1 freq eeswally (3) - 4 freq neville (3) - 14 freq neilly (3) - 12 freq eerily (3) - 1 freq leevils (3) - 1 freq deevil's (3) - 1 freq feenally (3) - 1 freq heavily (3) - 9 freq evill (3) - 1 freq |
eeevilly (0) - 1 freq ceevilly (2) - 5 freq evill (3) - 1 freq eivill (3) - 1 freq heevinly (4) - 2 freq villa (4) - 7 freq neville (4) - 14 freq neilly (4) - 12 freq seville (4) - 1 freq jeelly (4) - 1 freq ville (4) - 1 freq reeeally (4) - 1 freq reilly (4) - 3 freq helly (5) - 16 freq zilly (5) - 1 freq selly (5) - 1 freq raelly (5) - 67 freq hilly (5) - 6 freq eesell (5) - 1 freq everly (5) - 1 freq reveille (5) - 1 freq vll (5) - 1 freq felly (5) - 1 freq killy (5) - 9 freq willy (5) - 12 freq |
SoundEx code - E140 evil - 90 freq epple - 13 freq effel - 1 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 - EFL evil - 90 freq effel - 1 freq eeevilly - 1 freq eiffel - 2 freq eivill - 1 freq aefaal - 1 freq aefaallie - 1 freq evil' - 1 freq evill - 1 freq €˜evil - 2 freq efl - 2 freq |
EEEVILLY |
| Time to execute Levenshtein function - 0.252716 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.409087 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.049290 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.073517 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.001085 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. |