| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kevels (0) - 1 freq keels (1) - 4 freq levels (1) - 66 freq bevels (1) - 1 freq eves (2) - 1 freq reels (2) - 21 freq levils (2) - 1 freq kevil (2) - 1 freq penels (2) - 7 freq kemel's (2) - 1 freq levers (2) - 6 freq levels' (2) - 1 freq devals (2) - 1 freq teels (2) - 2 freq evils (2) - 4 freq eevees (2) - 1 freq hovels (2) - 1 freq rebels (2) - 21 freq level (2) - 148 freq kennels (2) - 5 freq novels (2) - 29 freq keel (2) - 12 freq peels (2) - 30 freq keele (2) - 1 freq keeps (2) - 161 freq |
kevels (0) - 1 freq levels (2) - 66 freq bevels (2) - 1 freq keels (2) - 4 freq navels (3) - 1 freq devals (3) - 1 freq evils (3) - 4 freq reveals (3) - 10 freq kivers (3) - 3 freq hovels (3) - 1 freq devils (3) - 1 freq leevels (3) - 1 freq nuvels (3) - 1 freq levils (3) - 1 freq kevil (3) - 1 freq kneels (3) - 1 freq kells (3) - 7 freq novels (3) - 29 freq unveils (4) - 1 freq kelso (4) - 2 freq anvils (4) - 1 freq keelt (4) - 2 freq eels (4) - 11 freq heels (4) - 77 freq novils (4) - 1 freq |
SoundEx code - K142 kevels - 1 freq kæbils - 1 freq |
MetaPhone code - KFLS kevels - 1 freq caffle's - 1 freq |
KEVELS |
| Time to execute Levenshtein function - 0.212696 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.358874 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.029676 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.044595 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.000864 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. |