| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lively (0) - 10 freq lovely (1) - 165 freq luvely (1) - 9 freq livery (1) - 13 freq likely (1) - 311 freq liveen (2) - 5 freq lives' (2) - 1 freq lovey (2) - 1 freq lived (2) - 150 freq lily (2) - 44 freq lovel (2) - 1 freq cliverly (2) - 1 freq luvuly (2) - 1 freq listly (2) - 1 freq limply (2) - 2 freq wicely (2) - 2 freq luvvly (2) - 1 freq nicely (2) - 16 freq lavey (2) - 2 freq luvly (2) - 5 freq wifely (2) - 2 freq lakely (2) - 2 freq level (2) - 148 freq livvy (2) - 49 freq livers (2) - 1 freq |
lively (0) - 10 freq luvely (1) - 9 freq lovely (1) - 165 freq lovel (2) - 1 freq luvly (2) - 5 freq likely (2) - 311 freq livery (2) - 13 freq level (2) - 148 freq luvuly (2) - 1 freq lavell (3) - 2 freq lovell (3) - 1 freq lonely (3) - 38 freq 'lovely (3) - 1 freq luv'ly (3) - 1 freq live (3) - 424 freq vievely (3) - 1 freq lanely (3) - 33 freq liver (3) - 34 freq livvel (3) - 2 freq levels (3) - 66 freq lives (3) - 241 freq livet (3) - 1 freq lvl (3) - 1 freq luverly (3) - 4 freq lately (3) - 57 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 |
LIVELY |
| Time to execute Levenshtein function - 0.200695 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.369483 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.033684 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.038087 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.000869 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. |