| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| levellt (0) - 1 freq levelt (1) - 1 freq lovell (2) - 1 freq revealt (2) - 1 freq mervellt (2) - 1 freq levelled (2) - 4 freq lavell (2) - 2 freq labellt (2) - 1 freq trevellt (2) - 2 freq revell (2) - 1 freq level (2) - 148 freq levels (2) - 66 freq levellin (2) - 5 freq levels' (2) - 1 freq labellit (3) - 1 freq yellt (3) - 4 freq leill (3) - 1 freq leavent (3) - 1 freq leviet (3) - 1 freq leevit (3) - 4 freq spellt (3) - 9 freq kevels (3) - 1 freq mesell (3) - 2 freq lever (3) - 2 freq reveal (3) - 21 freq |
levellt (0) - 1 freq levelt (2) - 1 freq lavell (3) - 2 freq levelled (3) - 4 freq labellt (3) - 1 freq levellin (3) - 5 freq lovell (3) - 1 freq revealt (4) - 1 freq labellit (4) - 1 freq raivellt (4) - 1 freq luvvult (4) - 1 freq devaallt (4) - 2 freq levels' (4) - 1 freq mervellt (4) - 1 freq trevellt (4) - 2 freq lullt (4) - 1 freq revell (4) - 1 freq levels (4) - 66 freq level (4) - 148 freq devellin (5) - 1 freq revealit (5) - 2 freq labelt (5) - 2 freq ravelt (5) - 1 freq sellt (5) - 31 freq legally (5) - 13 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 |
LEVELLT |
| Time to execute Levenshtein function - 0.205138 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.614207 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.028345 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.085784 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.000970 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. |