| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lendwirds (0) - 4 freq len-wirds (1) - 4 freq len-words (2) - 1 freq lonnwirds (2) - 2 freq landwords (2) - 1 freq landwards (2) - 1 freq len-wird (2) - 1 freq lenders (3) - 1 freq rendirs (3) - 2 freq keywirds (3) - 1 freq lonnwird (3) - 1 freq lendins (3) - 1 freq landlairds (3) - 1 freq hindwird (3) - 1 freq edwards (3) - 5 freq landward (3) - 6 freq endures (4) - 3 freq lends (4) - 9 freq seawird (4) - 1 freq enders (4) - 2 freq fenders (4) - 1 freq songbirds (4) - 2 freq onwards (4) - 19 freq landis (4) - 6 freq netwirks (4) - 7 freq |
lendwirds (0) - 4 freq landwords (2) - 1 freq landwards (2) - 1 freq len-wirds (2) - 4 freq lonnwirds (3) - 2 freq len-words (3) - 1 freq landlairds (4) - 1 freq len-wird (4) - 1 freq landward (4) - 6 freq hindwird (5) - 1 freq edwards (5) - 5 freq lenders (5) - 1 freq lonnwird (5) - 1 freq landmarks (6) - 1 freq inwards (6) - 7 freq nonwurds (6) - 1 freq landmairks (6) - 1 freq inwairds (6) - 1 freq landwart (6) - 11 freq ladybirds (6) - 1 freq landers (6) - 10 freq landlord (6) - 8 freq joedwards (6) - 10 freq liftwards (6) - 1 freq lendins (6) - 1 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 - LNTWRTS lendwirds - 4 freq landwards - 1 freq landwords - 1 freq |
LENDWIRDS |
| Time to execute Levenshtein function - 0.226756 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.419265 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.027484 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.037398 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.000899 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. |