| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| landart (0) - 2 freq landwart (1) - 11 freq lanwart (1) - 1 freq standart (2) - 45 freq pandert (2) - 1 freq wandert (2) - 5 freq laddert (2) - 1 freq landan (2) - 2 freq lanark (2) - 29 freq lundert (2) - 1 freq tankart (2) - 1 freq lunkart (2) - 1 freq landry (2) - 1 freq landet (2) - 5 freq landmark (2) - 4 freq landers (2) - 10 freq lander (2) - 13 freq mandat (2) - 2 freq ladar (2) - 1 freq handcart (2) - 1 freq landit (2) - 52 freq sandirt (2) - 1 freq lanyard (2) - 1 freq randert (2) - 1 freq landward (2) - 6 freq |
landart (0) - 2 freq lundert (2) - 1 freq lanwart (2) - 1 freq landwart (2) - 11 freq landers (3) - 10 freq landet (3) - 5 freq lander (3) - 13 freq sandirt (3) - 1 freq loundert (3) - 1 freq landry (3) - 1 freq landit (3) - 52 freq randert (3) - 1 freq pandert (3) - 1 freq lunkart (3) - 1 freq laddert (3) - 1 freq wandert (3) - 5 freq wanderit (4) - 2 freq laundry (4) - 10 freq daundert (4) - 8 freq hundert (4) - 7 freq wondert (4) - 10 freq rendert (4) - 3 freq dundert (4) - 1 freq laundit (4) - 11 freq lender (4) - 2 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 - LNTRT launderette - 1 freq landart - 2 freq loundert - 1 freq lundert - 1 freq |
LANDART |
| Time to execute Levenshtein function - 0.243049 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.366587 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.027399 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.037718 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.000863 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. |