Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lovely (0) - 162 freq lovell (1) - 1 freq 'lovely (1) - 1 freq lovey (1) - 1 freq lovel (1) - 1 freq lively (1) - 10 freq lonely (1) - 38 freq luvely (1) - 9 freq bovedy (2) - 3 freq lately (2) - 57 freq luvuly (2) - 1 freq novel (2) - 65 freq 'lonely (2) - 1 freq loveen (2) - 1 freq luverly (2) - 4 freq loved (2) - 186 freq tovey (2) - 2 freq hovel (2) - 4 freq loly (2) - 1 freq comely (2) - 4 freq hovels (2) - 1 freq luv'ly (2) - 1 freq levels (2) - 66 freq lowly (2) - 5 freq loney (2) - 1 freq |
lovely (0) - 162 freq luvely (1) - 9 freq lively (1) - 10 freq lovel (1) - 1 freq luvuly (2) - 1 freq level (2) - 146 freq lonely (2) - 38 freq lovell (2) - 1 freq luvly (2) - 5 freq 'lovely (2) - 1 freq lovey (2) - 1 freq lavey (3) - 2 freq likely (3) - 305 freq luvvly (3) - 1 freq lanely (3) - 31 freq livery (3) - 13 freq lolly (3) - 1 freq lakely (3) - 2 freq loves (3) - 63 freq lovinly (3) - 2 freq love (3) - 881 freq loosely (3) - 4 freq lvl (3) - 1 freq lonly (3) - 2 freq lavell (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 |
LOVELY |
Time to execute Levenshtein function - 0.593198 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.893570 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.027101 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.085068 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.000829 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. |