Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
laevil (0) - 1 freq laevin (1) - 12 freq devil (2) - 35 freq i'evil (2) - 1 freq leil (2) - 5 freq lavin (2) - 2 freq ceevil (2) - 45 freq leevit (2) - 4 freq faevir (2) - 2 freq laybil (2) - 2 freq levils (2) - 1 freq laev (2) - 3 freq laeves (2) - 16 freq lael (2) - 6 freq laein (2) - 9 freq leevils (2) - 1 freq lavvie (2) - 18 freq laepin (2) - 1 freq lawvie (2) - 1 freq laedit (2) - 1 freq levi (2) - 12 freq levit (2) - 2 freq laedin (2) - 1 freq anvil (2) - 5 freq laivin (2) - 2 freq |
laevil (0) - 1 freq level (2) - 148 freq laevin (2) - 12 freq lovel (3) - 1 freq levin (3) - 1 freq laevan (3) - 15 freq laivin (3) - 2 freq anvil (3) - 5 freq levit (3) - 2 freq laavie (3) - 1 freq evil (3) - 90 freq lvl (3) - 1 freq kevil (3) - 1 freq laeve (3) - 37 freq levi (3) - 12 freq leevin (3) - 195 freq deevil (3) - 17 freq laybil (3) - 2 freq levils (3) - 1 freq leil (3) - 5 freq i'evil (3) - 1 freq leevit (3) - 4 freq lavin (3) - 2 freq ceevil (3) - 45 freq laev (3) - 3 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 |
LAEVIL |
Time to execute Levenshtein function - 0.612224 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 - 1.067994 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.040728 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.155436 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.007502 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. |