| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lockerbie (0) - 8 freq lockerbieac (2) - 1 freq lotterie (3) - 1 freq sickerlie (3) - 1 freq cockenzie (3) - 1 freq locker (3) - 3 freq lockers (3) - 4 freq joukerie (3) - 3 freq poukerie (3) - 1 freq cherie (4) - 2 freq loiterin (4) - 3 freq lowerit (4) - 1 freq lockid (4) - 1 freq leerie (4) - 22 freq mackenzie (4) - 17 freq ticketie (4) - 1 freq acerbic (4) - 1 freq lock-in (4) - 1 freq racherie (4) - 1 freq lotternine (4) - 1 freq mckenzie (4) - 7 freq lockerbieshed (4) - 1 freq lerbin (4) - 2 freq socceraid (4) - 1 freq locked (4) - 49 freq |
lockerbie (0) - 8 freq lockerbieac (3) - 1 freq locker (4) - 3 freq lockers (4) - 4 freq sickerlie (5) - 1 freq lickers (5) - 2 freq lockars (5) - 2 freq licker (5) - 1 freq clockers (6) - 6 freq luckie (6) - 5 freq cockerel (6) - 5 freq clocker (6) - 3 freq looker (6) - 8 freq dockers (6) - 12 freq lockin (6) - 7 freq mockery (6) - 9 freq lockis (6) - 1 freq lockit (6) - 32 freq locket (6) - 5 freq lucerne (6) - 1 freq locke's (6) - 1 freq nickerin (6) - 1 freq flickerit (6) - 1 freq bickerin (6) - 7 freq clock-bee (6) - 1 freq |
SoundEx code - L261 lockerbie - 8 freq locharbriggs - 2 freq low-gravity - 1 freq logierieve - 1 freq lsrplaid - 1 freq lockerbieshed - 1 freq lockerbieac - 1 freq |
MetaPhone code - LKRB lockerbie - 8 freq |
LOCKERBIE |
| Time to execute Levenshtein function - 0.201393 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.337665 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.027418 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.037016 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.000862 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. |