| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| landward (0) - 6 freq landwards (1) - 1 freq landwart (1) - 11 freq launward (2) - 1 freq lanwart (2) - 1 freq landmark (2) - 4 freq lanyard (2) - 1 freq landart (2) - 2 freq landwords (2) - 1 freq landlord (2) - 8 freq oanward (2) - 1 freq lonnwird (3) - 1 freq akward (3) - 3 freq backward (3) - 11 freq landlairds (3) - 1 freq onward (3) - 5 freq langwach (3) - 17 freq janwar (3) - 2 freq eastward (3) - 2 freq bandara (3) - 11 freq bakward (3) - 2 freq lannlaird (3) - 1 freq landed (3) - 67 freq award (3) - 59 freq landmerk (3) - 1 freq |
landward (0) - 6 freq landwart (2) - 11 freq landwards (2) - 1 freq landwords (3) - 1 freq landlord (3) - 8 freq launward (3) - 1 freq landmark (4) - 4 freq lendwirds (4) - 4 freq len-wird (4) - 1 freq oanward (4) - 1 freq lonnwird (4) - 1 freq landart (4) - 2 freq lanyard (4) - 1 freq lanwart (4) - 1 freq inward (5) - 7 freq largoward (5) - 1 freq landmairk (5) - 4 freq lanlaird (5) - 1 freq ainward (5) - 4 freq landlady (5) - 9 freq jandlord (5) - 1 freq edward (5) - 33 freq liftward (5) - 1 freq sandwort (5) - 1 freq landers (5) - 10 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 - LNTWRT landwart - 11 freq landward - 6 freq |
LANDWARD |
| Time to execute Levenshtein function - 0.419808 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.867026 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.027589 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.098021 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.001135 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. |