| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| litcors (0) - 3 freq lickers (3) - 2 freq nibors (3) - 2 freq witches (3) - 35 freq infors (3) - 1 freq lincoln (3) - 3 freq mithers (3) - 80 freq latches (3) - 2 freq linford (3) - 1 freq hitches (3) - 2 freq ritirs (3) - 1 freq tutors (3) - 6 freq pictoors (3) - 1 freq lippers (3) - 9 freq stors (3) - 1 freq thors (3) - 1 freq librars (3) - 3 freq discos (3) - 6 freq minors (3) - 1 freq laters (3) - 12 freq pitches (3) - 15 freq vicars (3) - 1 freq lictors' (3) - 1 freq lacers (3) - 1 freq licks (3) - 12 freq |
litcors (0) - 3 freq lettirs (4) - 1 freq laters (4) - 12 freq loiters (4) - 1 freq leitches (4) - 1 freq lethers (4) - 1 freq letters (4) - 142 freq lancers (4) - 4 freq litres (4) - 3 freq letturs (4) - 3 freq lacers (4) - 1 freq latches (4) - 2 freq eithers (5) - 1 freq aithers (5) - 7 freq ithirs (5) - 10 freq withers (5) - 5 freq owthors (5) - 15 freq toors (5) - 4 freq letteris (5) - 1 freq lexicars (5) - 1 freq fitters (5) - 3 freq liars (5) - 1 freq lingers (5) - 5 freq tithers (5) - 1 freq luxors (5) - 1 freq |
SoundEx code - L326 lodger - 3 freq lodgers - 4 freq ludicrous - 3 freq lithograph - 1 freq ledgers - 2 freq lodger's - 1 freq ludger - 4 freq ludicrously - 1 freq lotus-garlans - 1 freq ludgers - 4 freq ledger - 1 freq ladycarrcarr - 1 freq litcors - 3 freq lategrowingseason - 1 freq |
MetaPhone code - LTKRS ludicrous - 3 freq litcors - 3 freq |
LITCORS |
| Time to execute Levenshtein function - 0.222712 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.443016 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.029873 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.066793 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.001427 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. |