| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lockupyergrans (0) - 1 freq supergran (6) - 1 freq locumtenand (7) - 3 freq cocksparra (7) - 1 freq souterrains (7) - 1 freq scupperan (7) - 1 freq dockyerds (7) - 2 freq leckerstanes (7) - 1 freq lockups (7) - 1 freq lockers (7) - 4 freq currans (7) - 1 freq goinundergroun (8) - 1 freq superman (8) - 6 freq lounderin (8) - 3 freq caperan (8) - 1 freq organs (8) - 12 freq lotus-garlans (8) - 1 freq operas (8) - 3 freq lochgarland (8) - 1 freq louran (8) - 1 freq oceans (8) - 16 freq cumberland (8) - 6 freq souterrain (8) - 1 freq undergrad (8) - 1 freq lounerin (8) - 1 freq |
lockupyergrans (0) - 1 freq leckerstanes (10) - 1 freq supergran (10) - 1 freq currans (11) - 1 freq backgruns (11) - 2 freq lockers (11) - 4 freq lockups (11) - 1 freq cockburns (12) - 2 freq lock-ins (12) - 1 freq blackcurran (12) - 1 freq blackcurrant (12) - 5 freq lickers (12) - 2 freq lockhart's (12) - 1 freq lockdowns (12) - 1 freq blackberries (12) - 1 freq lecturers (12) - 4 freq caperers (12) - 1 freq looderhorns (12) - 1 freq dockyerds (12) - 2 freq lockars (12) - 2 freq scupperan (12) - 1 freq souterrains (12) - 1 freq cocksparra (12) - 1 freq sperrins (12) - 1 freq sporrans (12) - 1 freq |
SoundEx code - L216 lug-covers - 2 freq lucifer - 8 freq lochaber - 5 freq 'lochaber - 1 freq lug-piercin - 1 freq low-spirited - 1 freq €˜lochaber - 1 freq lgvrplh - 1 freq lxbrh - 1 freq lisburnreads - 6 freq lewisferguson - 3 freq lockupyergrans - 1 freq lucyprosecco - 99 freq lsfortfkd - 1 freq lsportscoach - 1 freq lisburn - 1 freq lexiprice - 1 freq |
MetaPhone code - LKPYRKRN |
LOCKUPYERGRANS |
| Time to execute Levenshtein function - 0.371263 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.477367 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.031539 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.040115 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.000944 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. |