Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lantren (0) - 13 freq lantrens (1) - 2 freq lentren (1) - 2 freq luntren (1) - 1 freq canteen (2) - 20 freq wastren (2) - 7 freq patren (2) - 3 freq landen (2) - 1 freq landeen (2) - 3 freq lauren (2) - 21 freq laren (2) - 21 freq kaitren (2) - 6 freq pattren (2) - 12 freq latten (2) - 11 freq eastren (2) - 3 freq paitren (2) - 7 freq lantern (2) - 29 freq wanten (2) - 1 freq antrin (2) - 67 freq cantle (3) - 2 freq banterin (3) - 1 freq manted (3) - 1 freq dante (3) - 58 freq ganted (3) - 2 freq pinten (3) - 1 freq |
lantren (0) - 13 freq lentren (1) - 2 freq luntren (1) - 1 freq lantern (2) - 29 freq lantrens (2) - 2 freq antrin (3) - 67 freq lentern (3) - 3 freq luntin (4) - 1 freq banterin (4) - 1 freq blintrin (4) - 1 freq laneroon (4) - 1 freq linton (4) - 19 freq lintin (4) - 2 freq canterin (4) - 1 freq auntrin (4) - 1 freq centrin (4) - 1 freq santerin (4) - 1 freq lanterns (4) - 7 freq anteran (4) - 1 freq landeen (4) - 3 freq pattren (4) - 12 freq landen (4) - 1 freq patren (4) - 3 freq eastren (4) - 3 freq latten (4) - 11 freq |
SoundEx code - L536 lantrens - 2 freq lender - 2 freq lounderin - 3 freq luntren - 1 freq launderette - 1 freq landry - 1 freq lantern - 29 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 - LNTRN lounderin - 3 freq luntren - 1 freq lantern - 29 freq lantren - 13 freq lentren - 2 freq launderin - 2 freq lentern - 3 freq |
LANTREN |
Time to execute Levenshtein function - 0.251510 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.368760 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.027996 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.038213 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.000916 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. |