| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| luvlies (0) - 1 freq hurlies (2) - 1 freq lovies (2) - 1 freq lollies (2) - 2 freq wullies (2) - 9 freq laalies (2) - 3 freq lilies (2) - 19 freq lïlies (2) - 2 freq luvvie (2) - 1 freq purlies (2) - 1 freq sullies (2) - 3 freq lavvies (2) - 10 freq luviee (2) - 2 freq levies (2) - 1 freq gullies (2) - 3 freq lillies (2) - 1 freq uglies (2) - 1 freq luckies (2) - 1 freq bullies (2) - 6 freq luvelie (2) - 3 freq luves (2) - 16 freq dullies (2) - 2 freq luvlee (2) - 2 freq luggies (2) - 7 freq julius (3) - 5 freq |
luvlies (0) - 1 freq lillies (3) - 1 freq levils (3) - 1 freq levies (3) - 1 freq lavvies (3) - 10 freq luves (3) - 16 freq lilies (3) - 19 freq lovies (3) - 1 freq lollies (3) - 2 freq luvelie (3) - 3 freq laalies (3) - 3 freq luvlee (3) - 2 freq leevils (4) - 1 freq livelier (4) - 1 freq luvly (4) - 5 freq lives (4) - 241 freq luvulee (4) - 1 freq lulls (4) - 2 freq luvers (4) - 12 freq loveliest (4) - 6 freq allies (4) - 8 freq loves (4) - 68 freq luveless (4) - 1 freq luvs (4) - 11 freq louvres (4) - 2 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 |
LUVLIES |
| Time to execute Levenshtein function - 0.235986 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.510686 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.035005 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.037686 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. |