| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laich-shuts (0) - 1 freq laichest (4) - 2 freq laich-doun (4) - 1 freq laich-flett (4) - 1 freq laich-hoose (4) - 11 freq lichthoos (5) - 1 freq lichts (5) - 180 freq laichit (5) - 1 freq laighest (5) - 1 freq laich- (5) - 1 freq laichs (5) - 1 freq lichtshad (5) - 1 freq laich-in (5) - 1 freq daith-white (5) - 1 freq laists (5) - 1 freq laichmaist (5) - 1 freq laid-out (5) - 1 freq lichtsum (5) - 3 freq lairnscots (5) - 99 freq loch-sides (5) - 1 freq hauf-shut (5) - 2 freq like-she's (5) - 1 freq fish-guts (5) - 1 freq lace-ups (5) - 1 freq half-shut (5) - 4 freq |
laich-shuts (0) - 1 freq laich-hoose (6) - 11 freq loch-sides (7) - 1 freq laich-flett (7) - 1 freq laichest (7) - 2 freq like-she's (8) - 1 freq lichtshad (8) - 1 freq laichmaist (8) - 1 freq lichts (8) - 180 freq laich-doun (8) - 1 freq lichthoos (8) - 1 freq lichtis (9) - 1 freq high-status (9) - 2 freq lichties (9) - 1 freq chists (9) - 1 freq alichts (9) - 1 freq cushats (9) - 1 freq licht-hoose (9) - 1 freq airch-stanes (9) - 1 freq chests (9) - 7 freq lichthoose (9) - 21 freq all-sorts (9) - 1 freq bent-shots (9) - 1 freq lichtest (9) - 1 freq lum-hats (9) - 1 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 - LXXTS laich-shuts - 1 freq |
LAICH-SHUTS |
| Time to execute Levenshtein function - 0.277452 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.396695 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.027184 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.037034 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. |