| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| luvly (0) - 5 freq luvvy (1) - 5 freq luv'ly (1) - 1 freq luvvly (1) - 1 freq luvely (1) - 9 freq luvuly (1) - 1 freq lavy (2) - 3 freq levoy (2) - 1 freq luvs (2) - 11 freq curly (2) - 51 freq sluvvly (2) - 1 freq llvl (2) - 1 freq lvl (2) - 1 freq luv (2) - 183 freq lonly (2) - 2 freq luverly (2) - 4 freq lovely (2) - 162 freq luved (2) - 70 freq lykly (2) - 1 freq luves (2) - 16 freq july (2) - 71 freq lukuly (2) - 2 freq lucy (2) - 5 freq luve (2) - 329 freq lolly (2) - 1 freq |
luvly (0) - 5 freq luvuly (1) - 1 freq luvely (1) - 9 freq lvl (2) - 1 freq lovely (2) - 162 freq lively (2) - 10 freq luvlee (2) - 2 freq luvvy (2) - 5 freq luvvly (2) - 1 freq luv'ly (2) - 1 freq loudly (3) - 27 freq luvulee (3) - 1 freq livvy (3) - 49 freq likly (3) - 20 freq luvin (3) - 26 freq luvf (3) - 1 freq lull (3) - 7 freq lally (3) - 2 freq loly (3) - 1 freq lily (3) - 44 freq luvit (3) - 1 freq lovey (3) - 1 freq lovel (3) - 1 freq level (3) - 146 freq lekly (3) - 2 freq |
SoundEx code - L140 label - 56 freq lovely - 162 freq level - 146 freq lively - 10 freq law-plea - 2 freq lawfully - 3 freq lawful - 3 freq luvely - 9 freq luvelie - 3 freq luvlee - 2 freq laybil - 2 freq luvuly - 1 freq luvulee - 1 freq lapel - 3 freq livvel - 2 freq luv'ly - 1 freq liable - 4 freq 'lovely - 1 freq luvly - 5 freq laevil - 1 freq lavell - 2 freq leafully - 1 freq lovel - 1 freq lvl - 1 freq lovell - 1 freq loaf'll - 1 freq luffly - 3 freq luvvly - 1 freq llvl - 1 freq |
MetaPhone code - LFL lovely - 162 freq level - 146 freq lively - 10 freq lawfully - 3 freq lawful - 3 freq luvely - 9 freq luvelie - 3 freq luvlee - 2 freq luvuly - 1 freq luvulee - 1 freq livvel - 2 freq lughole - 3 freq luv'ly - 1 freq 'lovely - 1 freq luvly - 5 freq laevil - 1 freq lavell - 2 freq leafully - 1 freq lovel - 1 freq lvl - 1 freq lovell - 1 freq loaf'll - 1 freq luffly - 3 freq luvvly - 1 freq llvl - 1 freq |
LUVLY |
| Time to execute Levenshtein function - 0.193145 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.379721 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.028072 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.038151 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.000834 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. |