| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| luvely (0) - 9 freq luvvly (1) - 1 freq lovely (1) - 165 freq lively (1) - 10 freq luverly (1) - 4 freq luvly (1) - 5 freq luv'ly (1) - 1 freq luvuly (1) - 1 freq lukuly (2) - 2 freq gudely (2) - 1 freq luvers (2) - 12 freq sluvvly (2) - 1 freq luve's (2) - 5 freq lovey (2) - 1 freq levels (2) - 66 freq luvvy (2) - 5 freq luves (2) - 16 freq lovell (2) - 1 freq livery (2) - 13 freq likely (2) - 311 freq rudely (2) - 3 freq luver (2) - 8 freq lavell (2) - 2 freq level (2) - 148 freq nuvels (2) - 1 freq |
luvely (0) - 9 freq luvly (1) - 5 freq luvuly (1) - 1 freq lively (1) - 10 freq lovely (1) - 165 freq lovel (2) - 1 freq level (2) - 148 freq luvelie (2) - 3 freq luverly (2) - 4 freq luv'ly (2) - 1 freq luvvly (2) - 1 freq lonely (3) - 38 freq lvl (3) - 1 freq levelt (3) - 1 freq lately (3) - 57 freq lanely (3) - 33 freq 'lovely (3) - 1 freq lukuly (3) - 2 freq luvlee (3) - 2 freq luved (3) - 70 freq luvulee (3) - 1 freq luve (3) - 332 freq lakely (3) - 2 freq lavey (3) - 2 freq lovell (3) - 1 freq |
SoundEx code - L140 label - 57 freq lovely - 165 freq level - 148 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 - 165 freq level - 148 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 |
LUVELY |
| Time to execute Levenshtein function - 0.185355 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.325663 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.033626 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.036696 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. |