| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lenterns (0) - 1 freq lentern (1) - 3 freq lanterns (1) - 7 freq lantern (2) - 28 freq letter's (2) - 1 freq lenders (2) - 1 freq westerns (2) - 1 freq letteris (2) - 1 freq enters (2) - 10 freq lecters (2) - 1 freq letters (2) - 142 freq penter's (2) - 4 freq penters (2) - 2 freq lettern (2) - 1 freq efterins (3) - 1 freq 'letters (3) - 1 freq enterit (3) - 2 freq sterns (3) - 25 freq planters (3) - 4 freq lendins (3) - 1 freq centered (3) - 1 freq leaders (3) - 30 freq meneins (3) - 1 freq extens (3) - 1 freq leader's (3) - 2 freq |
lenterns (0) - 1 freq lanterns (1) - 7 freq lentern (2) - 3 freq lantrens (3) - 2 freq lantern (3) - 28 freq penter's (4) - 4 freq lentren (4) - 2 freq letters (4) - 142 freq lettern (4) - 1 freq penters (4) - 2 freq lenders (4) - 1 freq letter's (4) - 1 freq lecters (4) - 1 freq westerns (4) - 1 freq letteris (4) - 1 freq enters (4) - 10 freq conters (5) - 1 freq lecturs (5) - 4 freq westernes (5) - 1 freq laerns (5) - 4 freq winters (5) - 21 freq veterans (5) - 8 freq loners (5) - 1 freq dunters (5) - 6 freq lancers (5) - 4 freq |
SoundEx code - L536 lantrens - 2 freq lender - 2 freq lounderin - 3 freq luntren - 1 freq launderette - 1 freq landry - 1 freq lantern - 28 freq lanterns - 7 freq lantren - 13 freq lentren - 2 freq landwart - 11 freq laundry - 10 freq lamiter - 1 freq launderin - 2 freq lenders - 1 freq lameters - 5 freq landward - 6 freq landèrs - 4 freq lynotttours - 1 freq lunder - 1 freq lime-tree - 1 freq land-horse - 1 freq landart - 2 freq loundert - 1 freq laundry-wummin - 1 freq lendwirds - 4 freq landèr - 4 freq lander - 13 freq landers - 10 freq launderers - 1 freq lendrum - 1 freq landrover - 4 freq lentern - 3 freq lenterns - 1 freq lundert - 1 freq leannetervit - 1 freq landwards - 1 freq landwords - 1 freq lindaarella - 3 freq |
MetaPhone code - LNTRNS lantrens - 2 freq lanterns - 7 freq lenterns - 1 freq |
LENTERNS |
| Time to execute Levenshtein function - 0.219318 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.414520 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.059221 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.038868 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.000888 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. |