| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lochside (0) - 10 freq loch-side (1) - 1 freq lochyside (1) - 1 freq longside (2) - 1 freq loch-sides (2) - 1 freq dockside (2) - 9 freq lochaidh (2) - 1 freq lochs (3) - 32 freq cotside (3) - 1 freq coohide (3) - 1 freq norside (3) - 1 freq lopsided (3) - 1 freq mochie (3) - 4 freq lockid (3) - 1 freq offside (3) - 3 freq ochie (3) - 8 freq ootside (3) - 635 freq lichtie (3) - 2 freq southside (3) - 4 freq loshtie (3) - 3 freq ootdside (3) - 1 freq lochaldh (3) - 1 freq oanside (3) - 1 freq lochead (3) - 3 freq dochtie (3) - 3 freq |
lochside (0) - 10 freq lochyside (1) - 1 freq loch-side (2) - 1 freq lochead (4) - 3 freq lochheid (4) - 1 freq lochaidh (4) - 1 freq lochs (4) - 32 freq longside (4) - 1 freq dockside (4) - 9 freq loch-sides (4) - 1 freq locheil (5) - 3 freq lachie (5) - 4 freq chide (5) - 4 freq lochiel (5) - 1 freq lochee (5) - 1 freq lochfit (5) - 2 freq langside (5) - 15 freq lachs (5) - 3 freq localised (5) - 8 freq lichted (5) - 14 freq launside (5) - 1 freq backside (5) - 26 freq blackside (5) - 2 freq lochan-side (5) - 1 freq cochise (5) - 5 freq |
SoundEx code - L223 lochside - 10 freq locusts - 6 freq locust - 2 freq lacoste - 7 freq laziest - 1 freq loch-sides - 1 freq lochyside - 1 freq lcukit - 2 freq luckiest - 2 freq logistic - 1 freq laighest - 1 freq loch-side - 1 freq laichest - 2 freq logistical - 1 freq lichchtliein - 1 freq laich-shuts - 1 freq liguistically - 1 freq logistics - 3 freq lokiscottishrap - 15 freq luyzogtp - 1 freq leicester - 2 freq lucozade - 1 freq louisestewartls - 6 freq lsicat - 1 freq lizacatz - 3 freq lukazade - 1 freq |
MetaPhone code - LXST lochside - 10 freq lochyside - 1 freq loch-side - 1 freq laichest - 2 freq |
LOCHSIDE |
| Time to execute Levenshtein function - 0.184273 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.368097 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.027818 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.037579 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.000967 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. |