| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lawnmowers (0) - 1 freq lawnmower (1) - 1 freq landowners (3) - 7 freq leftowers (4) - 3 freq launmerks (4) - 1 freq makkowers (4) - 1 freq gang-mowers (4) - 1 freq lawers (4) - 8 freq lawyers (4) - 19 freq landowner (4) - 1 freq answers (4) - 74 freq lanmines (4) - 1 freq hangower (4) - 3 freq haudowers (4) - 1 freq hawners (4) - 1 freq launderers (4) - 1 freq layower (4) - 1 freq awners (4) - 3 freq landers (4) - 10 freq mowers (4) - 1 freq lawlanders (4) - 1 freq lameters (4) - 5 freq lawbors (4) - 1 freq lawbourers (4) - 3 freq lowers (4) - 7 freq |
lawnmowers (0) - 1 freq lawnmower (2) - 1 freq landowners (6) - 7 freq lawlanders (7) - 1 freq lameters (7) - 5 freq mowers (7) - 1 freq awners (7) - 3 freq lawbors (7) - 1 freq landers (7) - 10 freq lowers (7) - 7 freq lancers (7) - 4 freq larners (7) - 10 freq awnswer (7) - 2 freq launderers (7) - 1 freq lawbourers (7) - 3 freq awnsers (7) - 1 freq lawyers (7) - 19 freq lawers (7) - 8 freq launmerks (7) - 1 freq answers (7) - 74 freq leftowers (7) - 3 freq hawners (7) - 1 freq lanmines (7) - 1 freq wanderers (8) - 44 freq wanceower (8) - 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 - LNMWRS lawnmowers - 1 freq |
LAWNMOWERS |
| Time to execute Levenshtein function - 0.242263 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.394717 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.028258 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.037071 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.000902 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. |