| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lanercost (0) - 1 freq innermost (3) - 1 freq laneroon (3) - 1 freq lang-lost (3) - 2 freq bonfrost (4) - 1 freq lager's (4) - 1 freq langscowp (4) - 1 freq anenst (4) - 52 freq laest (4) - 48 freq landmercat (4) - 1 freq laverock (4) - 14 freq lawert (4) - 1 freq lamppost (4) - 1 freq hinnermost (4) - 1 freq overcast (4) - 3 freq sacerdott (4) - 1 freq hanest (4) - 1 freq langersome (4) - 1 freq waescot (4) - 1 freq fingerpost (4) - 2 freq anarchist (4) - 14 freq laetest (4) - 4 freq langest (4) - 20 freq andros (4) - 1 freq lacoste (4) - 7 freq |
lanercost (0) - 1 freq innermost (5) - 1 freq owercast (6) - 2 freq wanrest (6) - 1 freq anarchist (6) - 14 freq o'ercast (6) - 1 freq pentecost (6) - 2 freq lacoste (6) - 7 freq eftercast (6) - 5 freq lancs (6) - 1 freq oncost (6) - 1 freq overcast (6) - 3 freq langest (6) - 20 freq largest (6) - 5 freq liners (6) - 2 freq lang-lost (6) - 2 freq fiercest (6) - 2 freq lances (6) - 1 freq lairgest (6) - 9 freq loneliest (6) - 1 freq laneroon (6) - 1 freq loners (6) - 1 freq faircest (6) - 1 freq lawers (7) - 8 freq lasers (7) - 2 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 - LNRKST lanercost - 1 freq |
LANERCOST |
| Time to execute Levenshtein function - 0.279140 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.416956 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.028575 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.037476 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.000897 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. |