| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| levels (0) - 66 freq levers (1) - 6 freq level (1) - 146 freq leevels (1) - 1 freq levels' (1) - 1 freq levils (1) - 1 freq levelt (1) - 1 freq bevels (1) - 1 freq kevels (1) - 1 freq leeves (2) - 19 freq nuvels (2) - 1 freq leven's (2) - 2 freq lives (2) - 236 freq navels (2) - 1 freq eels (2) - 11 freq fevers (2) - 1 freq lively (2) - 10 freq reels (2) - 20 freq leeds (2) - 9 freq levellt (2) - 1 freq leavers (2) - 1 freq jeels (2) - 3 freq jewels (2) - 20 freq leives (2) - 3 freq levels (2) - 1 freq |
levels (0) - 66 freq levils (1) - 1 freq leevels (1) - 1 freq levelt (2) - 1 freq kevels (2) - 1 freq leevils (2) - 1 freq bevels (2) - 1 freq levers (2) - 6 freq level (2) - 146 freq levels' (2) - 1 freq lovers (3) - 20 freq lovell (3) - 1 freq labels (3) - 6 freq livers (3) - 1 freq evils (3) - 4 freq a-levels (3) - 1 freq leaves (3) - 203 freq levies (3) - 1 freq lapels (3) - 1 freq novels (3) - 29 freq o-levels (3) - 2 freq luve's (3) - 5 freq devils (3) - 1 freq leave's (3) - 1 freq love's (3) - 12 freq |
SoundEx code - L142 labels - 6 freq leafless - 4 freq love-light - 1 freq levels - 66 freq luveless - 1 freq loveless - 1 freq lifeless - 7 freq luvlies - 1 freq lapels - 1 freq loveliest - 5 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 |
LEVELS |
| Time to execute Levenshtein function - 0.196495 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.335620 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.027434 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.036939 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.000831 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. |