| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lodgin (0) - 5 freq lodging (1) - 1 freq login (1) - 2 freq lodgins (1) - 1 freq dodgin (1) - 4 freq ludgin (1) - 7 freq loggin (1) - 1 freq longin (1) - 6 freq hodgin (1) - 3 freq noggin (2) - 1 freq lownin (2) - 2 freq loosin (2) - 1 freq dodging (2) - 2 freq loddan (2) - 1 freq longing (2) - 1 freq lowsin (2) - 47 freq lowtin (2) - 1 freq lopin (2) - 1 freq lodger (2) - 3 freq laggin (2) - 1 freq louin (2) - 1 freq stodgin (2) - 1 freq gadgin (2) - 1 freq nogin (2) - 1 freq 'odin (2) - 1 freq |
lodgin (0) - 5 freq ludgin (1) - 7 freq loggin (2) - 1 freq longin (2) - 6 freq hodgin (2) - 3 freq lodging (2) - 1 freq dodgin (2) - 4 freq login (2) - 2 freq lodgins (2) - 1 freq ludgit (3) - 5 freq aidgin (3) - 1 freq lodge (3) - 27 freq judgin (3) - 17 freq logan (3) - 12 freq nidgin (3) - 3 freq edgin (3) - 3 freq wadgin (3) - 4 freq fidgin (3) - 13 freq luggin (3) - 20 freq wedgin (3) - 1 freq budgin (3) - 3 freq pledgin (3) - 1 freq loungin (3) - 1 freq langin (3) - 7 freq loadin (3) - 5 freq |
SoundEx code - L325 lodging - 1 freq ludgins - 8 freq laithsome - 8 freq ludginhouses - 1 freq ludgin-hoose - 3 freq ludgin-hooses - 2 freq ludgin-house - 1 freq lithsome-put - 1 freq littcen - 1 freq litigant - 1 freq ludgin - 7 freq litigants - 1 freq lodgin - 5 freq lodgin-hooses - 1 freq lodgins - 1 freq lüdgin - 1 freq lüdgins - 1 freq lithesome - 1 freq loathsome - 2 freq ladies-in-waiting - 1 freq lodesman - 2 freq laddie-general - 4 freq laddie-general's - 1 freq lützen - 1 freq latchin - 2 freq letsmelt - 1 freq ladyjinty - 2 freq letsmake - 1 freq ltsnotsoccer - 1 freq leithjenny - 3 freq litesome - 1 freq |
MetaPhone code - LJN legion - 26 freq ludgin - 7 freq lodgin - 5 freq lüdgin - 1 freq login - 2 freq |
LODGIN |
| Time to execute Levenshtein function - 0.193087 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.346748 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.027439 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.036937 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.000877 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. |