| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ludger (0) - 4 freq ludge (1) - 22 freq ledger (1) - 1 freq ludgers (1) - 4 freq ludged (1) - 7 freq ludges (1) - 2 freq lodger (1) - 3 freq lumber (2) - 5 freq plunger (2) - 1 freq hunger (2) - 50 freq mudges (2) - 1 freq lugar (2) - 4 freq lunges (2) - 2 freq udder (2) - 1 freq hudge (2) - 1 freq gadger (2) - 1 freq ledges (2) - 3 freq ludgit (2) - 5 freq tadger (2) - 3 freq dudder (2) - 1 freq linger (2) - 5 freq ledge (2) - 15 freq bugger (2) - 150 freq rudge (2) - 1 freq dodger (2) - 5 freq |
ludger (0) - 4 freq lodger (1) - 3 freq ledger (1) - 1 freq ludged (2) - 7 freq ludges (2) - 2 freq ludge (2) - 22 freq ludgers (2) - 4 freq ludgin (3) - 7 freq lodged (3) - 6 freq langer (3) - 227 freq longer (3) - 72 freq lodgers (3) - 4 freq lager (3) - 39 freq ledder (3) - 23 freq ladder (3) - 35 freq louder (3) - 40 freq lauder (3) - 6 freq codger (3) - 2 freq sodger (3) - 114 freq badger (3) - 6 freq cadger (3) - 5 freq wadger (3) - 5 freq ligger (3) - 1 freq rodger (3) - 4 freq lounger (3) - 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 - LJR lodger - 3 freq lager - 39 freq ludger - 4 freq ledger - 1 freq |
LUDGER |
| Time to execute Levenshtein function - 0.202028 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.381922 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.031164 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.038346 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.000900 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. |