| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lochleven (0) - 1 freq auchleven (2) - 1 freq lochinver (3) - 1 freq lochee (3) - 1 freq loch-en (3) - 1 freq lochmaben (3) - 2 freq lowlevel (3) - 1 freq kinlochleven (3) - 1 freq low-level (3) - 1 freq auchteen (4) - 5 freq heeven (4) - 12 freq slochtered (4) - 1 freq gosleen (4) - 1 freq lichen (4) - 9 freq tochered (4) - 4 freq achteen (4) - 2 freq flochterin (4) - 2 freq eleven (4) - 38 freq rochlin (4) - 1 freq cheen (4) - 2 freq moch-etten (4) - 1 freq longhaven (4) - 2 freq rockeen (4) - 1 freq lochaber (4) - 5 freq hochered (4) - 1 freq |
lochleven (0) - 1 freq auchleven (3) - 1 freq kinlochleven (5) - 1 freq lachlan (5) - 1 freq lochmaben (5) - 2 freq loch-en (5) - 1 freq lochinver (5) - 1 freq schlagen (6) - 1 freq lochinvar (6) - 1 freq achievin (6) - 3 freq cloven (6) - 5 freq lichten (6) - 8 freq cochalene (6) - 1 freq cochlin (6) - 1 freq lichtenin (6) - 9 freq localloon (6) - 1 freq lochiel (6) - 1 freq lochan (6) - 26 freq pochlin (6) - 1 freq locheil (6) - 3 freq rochlin (6) - 1 freq lowlevel (6) - 1 freq lichen (6) - 9 freq lochee (6) - 1 freq low-level (6) - 1 freq |
SoundEx code - L241 locally-produced - 1 freq lochleven - 1 freq lesleyfletche - 1 freq lkolfi - 1 freq lslvwvefiq - 1 freq leshieloves - 1 freq leughleabhar - 5 freq |
MetaPhone code - LXLFN lochleven - 1 freq |
LOCHLEVEN |
| Time to execute Levenshtein function - 0.207176 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.366558 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.028533 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.037066 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.000895 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. |