| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| launmerks (0) - 1 freq laundmerks (1) - 2 freq laundmerk (2) - 2 freq aunters (3) - 1 freq lanterns (3) - 7 freq saunders (3) - 2 freq daungers (3) - 2 freq hauners (3) - 6 freq landers (3) - 10 freq lancers (3) - 4 freq saunters (3) - 3 freq waunter's (3) - 1 freq landmarks (3) - 1 freq larners (3) - 10 freq haunders (3) - 1 freq gauners (3) - 1 freq daunners (3) - 1 freq launered (3) - 1 freq landmerk (3) - 1 freq haunners (3) - 1 freq launderers (3) - 1 freq aumers (3) - 4 freq waunners (3) - 2 freq flaunders (3) - 1 freq launderin (3) - 2 freq |
launmerks (0) - 1 freq laundmerks (2) - 2 freq landmarks (4) - 1 freq laundmerk (4) - 2 freq kenmarks (5) - 1 freq loungers (5) - 2 freq lugmairks (5) - 1 freq lancers (5) - 4 freq launderers (5) - 1 freq landmerk (5) - 1 freq landmairks (5) - 1 freq lanterns (5) - 7 freq landers (5) - 10 freq lenterns (6) - 1 freq danemerk (6) - 3 freq lorimer's (6) - 9 freq unmarkt (6) - 1 freq limmers (6) - 4 freq lenders (6) - 1 freq kenmairks (6) - 6 freq lingers (6) - 5 freq lanks (6) - 1 freq landmark (6) - 4 freq larks (6) - 4 freq cluifmerks (6) - 1 freq |
SoundEx code - L562 lanarkshire - 18 freq lawnmowers - 1 freq lanark - 29 freq lunmerhaugh - 1 freq limmerhaugh - 1 freq launmerks - 1 freq limmers - 4 freq lanrick - 1 freq loners - 1 freq limerick - 7 freq limericks - 1 freq lanrik - 2 freq lanrikshire - 2 freq lamarck - 1 freq lanercost - 1 freq liners - 2 freq leonrousseau - 75 freq |
MetaPhone code - LNMRKS launmerks - 1 freq |
LAUNMERKS |
| Time to execute Levenshtein function - 0.255351 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.399633 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.045504 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.054016 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.001198 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. |