| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| level (0) - 148 freq leve (1) - 2 freq leven (1) - 17 freq levelt (1) - 1 freq levels (1) - 66 freq lever (1) - 2 freq revel (1) - 2 freq lovel (1) - 1 freq grevel (2) - 4 freq lives (2) - 241 freq lee (2) - 155 freq luver (2) - 8 freq reel (2) - 44 freq yesel (2) - 1 freq ravel (2) - 2 freq fecel (2) - 1 freq repel (2) - 2 freq heel (2) - 36 freq leal (2) - 43 freq desel (2) - 4 freq tebel (2) - 1 freq ladel (2) - 3 freq leed (2) - 25 freq leil (2) - 5 freq leaven (2) - 1 freq |
level (0) - 148 freq lovel (1) - 1 freq lovely (2) - 165 freq lvl (2) - 1 freq luvely (2) - 9 freq lively (2) - 10 freq laevil (2) - 1 freq revel (2) - 2 freq leven (2) - 17 freq leve (2) - 2 freq levels (2) - 66 freq levelt (2) - 1 freq lever (2) - 2 freq itvel (3) - 1 freq laeves (3) - 16 freq leeves (3) - 19 freq lovell (3) - 1 freq lavell (3) - 2 freq pavel (3) - 1 freq loved (3) - 190 freq laeve (3) - 37 freq love (3) - 913 freq luvlee (3) - 2 freq lapel (3) - 3 freq levied (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 |
LEVEL |
| Time to execute Levenshtein function - 0.175881 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.371852 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.028207 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.040511 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.000927 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. |