| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| limericks (0) - 1 freq limerick (1) - 7 freq tirricks (3) - 5 freq pinpricks (3) - 1 freq laverick (3) - 1 freq lerick (3) - 1 freq americky (3) - 3 freq lipsticks (3) - 3 freq liveries (3) - 1 freq laricks (3) - 1 freq americas (3) - 6 freq kinricks (3) - 1 freq laverocks (3) - 5 freq lairicks (3) - 1 freq limekilns (3) - 1 freq limelikns (3) - 1 freq liberals (4) - 5 freq libertees (4) - 1 freq larick (4) - 1 freq literacy (4) - 34 freq restricks (4) - 1 freq likewice (4) - 2 freq pairtricks (4) - 1 freq lanrick (4) - 1 freq hamesick (4) - 1 freq |
limericks (0) - 1 freq limerick (2) - 7 freq laverocks (4) - 5 freq lairicks (4) - 1 freq laricks (4) - 1 freq americas (5) - 6 freq lamarck (5) - 1 freq kinricks (5) - 1 freq laverick (5) - 1 freq tirricks (5) - 5 freq lerick (5) - 1 freq americky (5) - 3 freq laevrick (6) - 2 freq america's (6) - 1 freq remerks (6) - 8 freq lerrick (6) - 4 freq liberace's (6) - 2 freq americans (6) - 16 freq laverock's (6) - 2 freq lyrics (6) - 24 freq bricks (6) - 25 freq laverock (6) - 14 freq literacies (6) - 1 freq americkie (6) - 4 freq leverock (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 - LMRKS limericks - 1 freq |
LIMERICKS |
| Time to execute Levenshtein function - 0.490227 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.881513 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.029184 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.070482 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.001193 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. |