| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lecher (0) - 1 freq lether (1) - 2 freq blecher (1) - 2 freq lachter (2) - 16 freq pecker (2) - 1 freq lached (2) - 5 freq fether (2) - 23 freq teucher (2) - 4 freq heched (2) - 1 freq letter (2) - 239 freq lech (2) - 1 freq heicher (2) - 30 freq lever (2) - 2 freq eether (2) - 12 freq leper (2) - 2 freq fecker (2) - 14 freq aether (2) - 1 freq nicher (2) - 5 freq ledder (2) - 23 freq leeches (2) - 4 freq locker (2) - 3 freq liche (2) - 5 freq wether (2) - 2 freq nether (2) - 26 freq ficher (2) - 4 freq |
lecher (0) - 1 freq laicher (2) - 5 freq blecher (2) - 2 freq lether (2) - 2 freq luther (3) - 9 freq cher (3) - 6 freq teecher (3) - 1 freq lither (3) - 1 freq leather (3) - 75 freq echr (3) - 1 freq lurcher (3) - 1 freq acher (3) - 1 freq lochee (3) - 1 freq lectur (3) - 2 freq sicher (3) - 1 freq leuched (3) - 1 freq lecht (3) - 3 freq lyther (3) - 1 freq leeched (3) - 1 freq rocher (3) - 5 freq lather (3) - 1 freq hicher (3) - 1 freq licker (3) - 1 freq lichter (3) - 8 freq leaches (3) - 3 freq |
SoundEx code - L260 leisure - 26 freq luxury - 16 freq lesser - 29 freq liquor - 7 freq liker - 9 freq lookir - 1 freq laugher - 1 freq looker - 8 freq laicher - 5 freq lager - 38 freq leesure - 4 freq lecher - 1 freq lycra - 2 freq lacquer - 2 freq locker - 3 freq loser - 4 freq luxurie - 1 freq luckier - 5 freq le'sure - 1 freq lugar - 4 freq leesuir - 1 freq liqueur - 2 freq ligger - 1 freq laser - 4 freq loccery - 1 freq looser - 2 freq leisur - 4 freq leesur - 1 freq logger - 1 freq lyker - 2 freq luxure - 1 freq look-owre - 1 freq luk-ower - 4 freq lxr - 1 freq licker - 1 freq lzra - 1 freq lgr - 1 freq lukeyhear - 1 freq lgaur - 1 freq lswhr - 1 freq |
MetaPhone code - LXR laicher - 5 freq lecher - 1 freq |
LECHER |
| Time to execute Levenshtein function - 0.186918 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.354509 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.028789 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.037552 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.000843 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. |