Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lander (0) - 13 freq wander (1) - 36 freq landet (1) - 5 freq sander (1) - 1 freq landers (1) - 10 freq landed (1) - 67 freq zander (1) - 43 freq pander (1) - 1 freq slander (1) - 3 freq rander (1) - 2 freq dander (1) - 61 freq lauder (1) - 6 freq langer (1) - 223 freq landen (1) - 1 freq lender (1) - 2 freq lunder (1) - 1 freq ladder (1) - 35 freq larder (1) - 9 freq gander (1) - 12 freq tanner (2) - 10 freq linker (2) - 1 freq lapper (2) - 1 freq bunder (2) - 1 freq lanley (2) - 1 freq blender (2) - 3 freq |
lander (0) - 13 freq lender (1) - 2 freq lunder (1) - 1 freq sander (2) - 1 freq landet (2) - 5 freq landen (2) - 1 freq larder (2) - 9 freq gander (2) - 12 freq landry (2) - 1 freq wander (2) - 36 freq langer (2) - 223 freq ladder (2) - 35 freq zander (2) - 43 freq lauder (2) - 6 freq landers (2) - 10 freq landed (2) - 67 freq pander (2) - 1 freq slander (2) - 3 freq dander (2) - 61 freq rander (2) - 2 freq louder (3) - 40 freq sender (3) - 2 freq lieder (3) - 4 freq yonder (3) - 67 freq waander (3) - 5 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 - LNTR lender - 2 freq landry - 1 freq laundry - 10 freq lunder - 1 freq landèr - 4 freq lander - 13 freq |
LANDER |
Time to execute Levenshtein function - 0.404063 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.781639 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.034374 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.116020 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.000828 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. |