| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evill (0) - 1 freq evils (1) - 4 freq eivill (1) - 1 freq evil (1) - 90 freq evil' (1) - 1 freq yill (2) - 59 freq evir (2) - 4 freq 'yill (2) - 1 freq revell (2) - 1 freq swill (2) - 2 freq leill (2) - 1 freq ville (2) - 1 freq pill (2) - 12 freq voll (2) - 1 freq devils (2) - 1 freq shill (2) - 4 freq ruill (2) - 2 freq vll (2) - 1 freq drill (2) - 53 freq kill (2) - 216 freq skill (2) - 55 freq mill (2) - 82 freq sill (2) - 19 freq vil (2) - 2 freq €œill (2) - 1 freq |
evill (0) - 1 freq eivill (1) - 1 freq vaill (2) - 7 freq vll (2) - 1 freq voll (2) - 1 freq villa (2) - 7 freq ville (2) - 1 freq evil (2) - 90 freq evil' (2) - 1 freq evils (2) - 4 freq yuill (3) - 5 freq hill (3) - 468 freq bill (3) - 551 freq wuill (3) - 1 freq paill (3) - 1 freq weill (3) - 378 freq jill (3) - 14 freq gill (3) - 3 freq neville (3) - 14 freq fill (3) - 218 freq faill (3) - 1 freq ahill (3) - 1 freq vile (3) - 14 freq haill (3) - 411 freq ee'll (3) - 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 |
EVILL |
| Time to execute Levenshtein function - 0.311247 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.581680 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.037660 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.047994 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.001284 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. |