| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| levelt (0) - 1 freq levels (1) - 66 freq levellt (1) - 1 freq level (1) - 148 freq luvely (2) - 9 freq lovely (2) - 165 freq leviet (2) - 1 freq leve (2) - 2 freq feelt (2) - 22 freq slevert (2) - 1 freq revert (2) - 4 freq heelt (2) - 3 freq lovel (2) - 1 freq eveit (2) - 3 freq levers (2) - 6 freq jeelt (2) - 16 freq leest (2) - 12 freq livert (2) - 1 freq levit (2) - 2 freq lavell (2) - 2 freq event (2) - 103 freq geelt (2) - 2 freq beelt (2) - 1 freq leent (2) - 26 freq ledeit (2) - 2 freq |
levelt (0) - 1 freq level (2) - 148 freq levels (2) - 66 freq levellt (2) - 1 freq lavell (3) - 2 freq levit (3) - 2 freq livert (3) - 1 freq revealt (3) - 1 freq livet (3) - 1 freq leave't (3) - 2 freq lovell (3) - 1 freq leavent (3) - 1 freq ravelt (3) - 1 freq leevels (3) - 1 freq revolt (3) - 3 freq levils (3) - 1 freq lively (3) - 10 freq leviet (3) - 1 freq lovely (3) - 165 freq luvely (3) - 9 freq lovel (3) - 1 freq labelt (3) - 2 freq lullt (4) - 1 freq ogvlt (4) - 1 freq severt (4) - 1 freq |
SoundEx code - L143 lea-field - 1 freq levelled - 4 freq liability - 5 freq labelled - 13 freq leaflets - 10 freq leafletin - 3 freq luvvult - 1 freq leaflet - 11 freq labelt - 2 freq levelt - 1 freq livelihoods - 2 freq label't - 2 freq labellt - 1 freq l'evolution - 1 freq level-heiditness - 1 freq levellt - 1 freq livelihood - 1 freq labellit - 1 freq love-letter - 1 freq leafleting - 1 freq |
MetaPhone code - LFLT lea-field - 1 freq levelled - 4 freq luvvult - 1 freq leaflet - 11 freq levelt - 1 freq levellt - 1 freq |
LEVELT |
| Time to execute Levenshtein function - 0.200625 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.346035 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.027947 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.037944 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.000903 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. |