| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| levils (0) - 1 freq evils (1) - 4 freq devils (1) - 1 freq leevils (1) - 1 freq levels (1) - 66 freq levies (1) - 1 freq levin (2) - 1 freq leits (2) - 1 freq kevil (2) - 1 freq lavins (2) - 1 freq revile (2) - 3 freq hevins (2) - 1 freq levied (2) - 1 freq weevils (2) - 1 freq levers (2) - 6 freq leis (2) - 1 freq lewis (2) - 68 freq evill (2) - 1 freq leill (2) - 1 freq leims (2) - 4 freq lovies (2) - 1 freq novils (2) - 1 freq leil (2) - 5 freq leids (2) - 466 freq leains (2) - 3 freq |
levils (0) - 1 freq levels (1) - 66 freq leevils (1) - 1 freq leevels (2) - 1 freq levies (2) - 1 freq evils (2) - 4 freq devils (2) - 1 freq lovies (3) - 1 freq levels' (3) - 1 freq novils (3) - 1 freq deivils (3) - 1 freq level (3) - 148 freq deevils (3) - 11 freq laevil (3) - 1 freq devals (3) - 1 freq levelt (3) - 1 freq veils (3) - 3 freq anvils (3) - 1 freq lavins (3) - 1 freq leavins (3) - 11 freq bevels (3) - 1 freq weevils (3) - 1 freq kevels (3) - 1 freq luvlies (3) - 1 freq levers (3) - 6 freq |
SoundEx code - L142 labels - 6 freq leafless - 4 freq love-light - 1 freq levels - 66 freq luveless - 1 freq loveliest - 6 freq loveless - 1 freq lifeless - 7 freq luvlies - 1 freq lapels - 1 freq level-crossin - 1 freq levels' - 1 freq lifelessness - 1 freq lyfie-lik - 1 freq leevils - 1 freq leevels - 1 freq leaf-lik - 1 freq levils - 1 freq liwuplxrqr - 1 freq levels - 1 freq leavealightonforscotland - 1 freq loopholes - 1 freq |
MetaPhone code - LFLS leafless - 4 freq levels - 66 freq luveless - 1 freq loveless - 1 freq lifeless - 7 freq luvlies - 1 freq levels' - 1 freq lugholes - 1 freq leevils - 1 freq leevels - 1 freq levils - 1 freq yleflz - 1 freq levels - 1 freq loopholes - 1 freq |
LEVILS |
| Time to execute Levenshtein function - 0.423531 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.899622 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.107801 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.104186 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.000833 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. |