| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lundert (0) - 1 freq lunder (1) - 1 freq loundert (1) - 1 freq wundert (1) - 1 freq dundert (1) - 1 freq hundert (1) - 7 freq hunderd (2) - 1 freq daundert (2) - 8 freq wondert (2) - 10 freq 'under (2) - 2 freq yunder (2) - 10 freq funnert (2) - 2 freq randert (2) - 1 freq bundelt (2) - 1 freq hungert (2) - 39 freq hunert (2) - 5 freq sunder (2) - 1 freq foundert (2) - 3 freq landart (2) - 2 freq auntert (2) - 1 freq dunder (2) - 5 freq wandert (2) - 5 freq murdert (2) - 11 freq laddert (2) - 1 freq hunderts (2) - 1 freq |
lundert (0) - 1 freq loundert (1) - 1 freq landart (2) - 2 freq dundert (2) - 1 freq hundert (2) - 7 freq wundert (2) - 1 freq lunder (2) - 1 freq wandert (3) - 5 freq lingert (3) - 2 freq lunkart (3) - 1 freq rendert (3) - 3 freq lender (3) - 2 freq foundert (3) - 3 freq landet (3) - 5 freq cindert (3) - 1 freq laddert (3) - 1 freq sindert (3) - 41 freq wondert (3) - 10 freq daundert (3) - 8 freq landers (3) - 10 freq lander (3) - 13 freq pandert (3) - 1 freq lenders (3) - 1 freq randert (3) - 1 freq hunnert (4) - 14 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 - LNTRT launderette - 1 freq landart - 2 freq loundert - 1 freq lundert - 1 freq |
LUNDERT |
| Time to execute Levenshtein function - 0.909198 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 - 1.594020 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.099080 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.109628 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.000883 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. |