| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| loveliest (0) - 5 freq loneliest (1) - 1 freq novelist (2) - 4 freq loveless (2) - 1 freq lovies (3) - 1 freq luveless (3) - 1 freq lollies (3) - 2 freq timeliest (3) - 1 freq loyalist (3) - 9 freq holiest (3) - 2 freq luvelie (3) - 3 freq love-light (3) - 1 freq loneliness (3) - 5 freq luvlies (3) - 1 freq skeeliest (3) - 3 freq livelier (3) - 1 freq liveries (3) - 1 freq novelists (3) - 8 freq relient (4) - 1 freq lorries (4) - 5 freq likeliness (4) - 1 freq rollies (4) - 1 freq lavvies (4) - 10 freq leist (4) - 3 freq obedient (4) - 2 freq |
loveliest (0) - 5 freq loneliest (2) - 1 freq loveless (3) - 1 freq novelist (3) - 4 freq loyalist (4) - 9 freq luvlies (4) - 1 freq luveless (4) - 1 freq levels (5) - 66 freq novelists (5) - 8 freq liveries (5) - 1 freq levellt (5) - 1 freq levelt (5) - 1 freq livelier (5) - 1 freq leetlest (5) - 1 freq levels' (5) - 1 freq holiest (5) - 2 freq skeeliest (5) - 3 freq lollies (5) - 2 freq lovies (5) - 1 freq luvelie (5) - 3 freq timeliest (5) - 1 freq veluet (6) - 1 freq allest (6) - 1 freq leevils (6) - 1 freq love-light (6) - 1 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 - LFLST loveliest - 5 freq |
LOVELIEST |
| Time to execute Levenshtein function - 0.206379 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.389744 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.027320 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.039036 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.000876 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. |