Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lager (0) - 38 freq later (1) - 550 freq pager (1) - 1 freq laer (1) - 1 freq eager (1) - 27 freq langer (1) - 223 freq layer (1) - 13 freq wager (1) - 9 freq larger (1) - 3 freq lagers (1) - 2 freq laser (1) - 4 freq lawer (1) - 10 freq lane' (2) - 2 freq ganger (2) - 1 freq ajer (2) - 2 freq namer (2) - 1 freq lower (2) - 57 freq lames (2) - 1 freq laern (2) - 13 freq loser (2) - 4 freq aver (2) - 4 freq aaber (2) - 22 freq suger (2) - 1 freq laed (2) - 23 freq latter (2) - 24 freq |
lager (0) - 38 freq lagers (2) - 2 freq larger (2) - 3 freq lawer (2) - 10 freq lgr (2) - 1 freq lugar (2) - 4 freq wager (2) - 9 freq laser (2) - 4 freq layer (2) - 13 freq later (2) - 550 freq laer (2) - 1 freq pager (2) - 1 freq langer (2) - 223 freq eager (2) - 27 freq lare (3) - 7 freq laiter (3) - 4 freq liter (3) - 1 freq leader (3) - 58 freq launer (3) - 1 freq lover (3) - 27 freq roger (3) - 5 freq logger (3) - 1 freq lag (3) - 5 freq ler (3) - 1 freq luge (3) - 1 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 - LJR lodger - 3 freq lager - 38 freq ludger - 4 freq ledger - 1 freq |
LAGER |
Time to execute Levenshtein function - 0.172163 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.325284 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.030868 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.040779 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.000841 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. |