| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| labellin (0) - 1 freq labellit (1) - 1 freq levellin (2) - 5 freq labelled (2) - 13 freq labellt (2) - 1 freq ladelin (2) - 1 freq bellin (2) - 3 freq berlin (3) - 14 freq lavein (3) - 1 freq modellin (3) - 3 freq callin (3) - 30 freq lenabellina (3) - 1 freq lanerlie (3) - 2 freq bellie (3) - 6 freq dellin (3) - 5 freq devellin (3) - 1 freq cancellin (3) - 1 freq beilin (3) - 3 freq b'tellin (3) - 1 freq babblin (3) - 2 freq towellin (3) - 1 freq lamellol (3) - 1 freq tellin (3) - 611 freq beltin (3) - 22 freq wellin (3) - 5 freq |
labellin (0) - 1 freq labellit (2) - 1 freq bellin (3) - 3 freq labellt (3) - 1 freq levellin (3) - 5 freq labelled (3) - 13 freq lallan (4) - 6 freq lellan (4) - 1 freq lenabellina (4) - 1 freq ballin (4) - 3 freq ladelin (4) - 1 freq lollin (4) - 2 freq rebellion (4) - 36 freq levellin' (5) - 3 freq pallin (5) - 2 freq laidlin (5) - 1 freq gabblin (5) - 4 freq raivellin (5) - 1 freq revellin (5) - 3 freq sellin (5) - 70 freq lavell (5) - 2 freq labels (5) - 6 freq caallin (5) - 1 freq yabblin (5) - 2 freq abell (5) - 1 freq |
SoundEx code - L145 levellin - 5 freq leef-alane - 1 freq lipliners - 1 freq lifelong - 4 freq lifelang - 2 freq labellin - 1 freq life-lang - 3 freq levellin' - 3 freq lapland - 3 freq lyfe-lang - 1 freq lifelong-learning - 1 freq |
MetaPhone code - LBLN labellin - 1 freq |
LABELLIN |
| Time to execute Levenshtein function - 0.195967 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.363409 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.028305 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.038699 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.001031 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. |