| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lodgins (0) - 1 freq ludgins (1) - 8 freq lodgin (1) - 5 freq lodging (1) - 1 freq logans (2) - 1 freq loddies (2) - 3 freq loamins (2) - 1 freq dodgin (2) - 4 freq loins (2) - 3 freq dodging (2) - 2 freq login (2) - 2 freq coggins (2) - 1 freq hodgin (2) - 3 freq dodgin' (2) - 1 freq codlins (2) - 4 freq loweins (2) - 1 freq ludgin (2) - 7 freq joogins (2) - 2 freq longing (2) - 1 freq loanins (2) - 7 freq longin (2) - 6 freq noggins (2) - 2 freq lodgers (2) - 4 freq lüdgins (2) - 1 freq lordlins (2) - 1 freq |
lodgins (0) - 1 freq ludgins (1) - 8 freq lodging (2) - 1 freq lodgin (2) - 5 freq leggins (3) - 3 freq logans (3) - 1 freq lodgers (3) - 4 freq ludgin (3) - 7 freq floggins (4) - 1 freq lüdgins (4) - 1 freq lordlins (4) - 1 freq loggin (4) - 1 freq lydians (4) - 1 freq ludgers (4) - 4 freq ladrons (4) - 1 freq legions (4) - 9 freq ledges (4) - 3 freq ludges (4) - 2 freq laggans (4) - 1 freq noggins (4) - 2 freq loudens (4) - 1 freq ledgers (4) - 2 freq loamins (4) - 1 freq login (4) - 2 freq hodgin (4) - 3 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 - LJNS ludgins - 8 freq legions - 9 freq lodgins - 1 freq lüdgins - 1 freq |
LODGINS |
| Time to execute Levenshtein function - 0.225201 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.370070 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.027676 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.040390 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.001193 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. |