| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lanrick (0) - 1 freq larick (1) - 1 freq lanrik (1) - 2 freq laevrick (2) - 2 freq lerrick (2) - 4 freq kangrick (2) - 6 freq africk (2) - 1 freq janick (2) - 1 freq lairicks (2) - 1 freq laverick (2) - 1 freq kinrick (2) - 22 freq carrick (2) - 6 freq cantick (2) - 1 freq laricks (2) - 1 freq patrick (2) - 32 freq lerick (2) - 1 freq henrick (2) - 3 freq bannock (3) - 18 freq renwick (3) - 18 freq ferrick (3) - 1 freq lanfine (3) - 1 freq rurick (3) - 1 freq atrack (3) - 1 freq lassock (3) - 2 freq varck (3) - 1 freq |
lanrick (0) - 1 freq lanrik (2) - 2 freq larick (2) - 1 freq henrick (3) - 3 freq laverick (3) - 1 freq lerick (3) - 1 freq lerrick (3) - 4 freq kinrick (3) - 22 freq laevrick (3) - 2 freq lamarck (4) - 1 freq laverock (4) - 14 freq patrick (4) - 32 freq limerick (4) - 7 freq lanark (4) - 29 freq laebrack (4) - 1 freq laricks (4) - 1 freq lairicks (4) - 1 freq janick (4) - 1 freq africk (4) - 1 freq carrick (4) - 6 freq kangrick (4) - 6 freq cantick (4) - 1 freq lapraik (5) - 1 freq enrico (5) - 1 freq glamrock (5) - 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 - LNRK lanark - 29 freq lanrick - 1 freq lanrik - 2 freq |
LANRICK |
| Time to execute Levenshtein function - 0.202852 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.380381 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.034467 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.037776 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.000865 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. |