| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| labellit (0) - 1 freq labellin (1) - 1 freq labellt (1) - 1 freq label't (2) - 2 freq labelt (2) - 2 freq labelled (2) - 13 freq lanelie (3) - 1 freq yellit (3) - 1 freq laekit (3) - 18 freq laedit (3) - 1 freq raellie (3) - 18 freq lamentit (3) - 1 freq labels (3) - 6 freq ravell't (3) - 1 freq spellit (3) - 1 freq yallit (3) - 1 freq lamp-lit (3) - 1 freq levellt (3) - 1 freq waelit (3) - 1 freq wabblit (3) - 1 freq appellit (3) - 1 freq lamplit (3) - 1 freq ladelin (3) - 1 freq bellie (3) - 6 freq label (3) - 57 freq |
labellit (0) - 1 freq labellt (1) - 1 freq labellin (2) - 1 freq labelt (3) - 2 freq labelled (3) - 13 freq label't (3) - 2 freq bellt (4) - 1 freq bullit (4) - 1 freq levellt (4) - 1 freq callit (5) - 3 freq lavell (5) - 2 freq lamellol (5) - 1 freq bellin (5) - 3 freq bell-it (5) - 1 freq ballot (5) - 10 freq ballet (5) - 4 freq abeelity (5) - 7 freq abell (5) - 1 freq bullet (5) - 32 freq levellin (5) - 5 freq 'ballet (5) - 1 freq ballat (5) - 1 freq zabell (5) - 1 freq wallit (5) - 1 freq stellit (5) - 11 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 - LBLT liability - 5 freq labelled - 13 freq labelt - 2 freq label't - 2 freq labellt - 1 freq labellit - 1 freq |
LABELLIT |
| Time to execute Levenshtein function - 0.184901 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.359869 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.028923 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.037574 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.001048 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. |