| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lützen (0) - 1 freq lüdgin (3) - 1 freq looten (3) - 1 freq lïsten (3) - 11 freq listnen (3) - 1 freq cítizen (3) - 1 freq yüen (3) - 1 freq luntren (3) - 1 freq latten (3) - 11 freq lhsten (3) - 1 freq littcen (3) - 1 freq hüben (3) - 1 freq lentren (3) - 2 freq lantren (3) - 13 freq rütted (3) - 1 freq listen (3) - 491 freq litten (3) - 2 freq lutten (3) - 2 freq blitzen (3) - 1 freq aiteen (4) - 1 freq laither (4) - 2 freq gotten (4) - 323 freq lumpen (4) - 1 freq often (4) - 126 freq waltzes (4) - 4 freq |
lützen (0) - 1 freq lüdgin (5) - 1 freq cítizen (5) - 1 freq lantren (6) - 13 freq lentren (6) - 2 freq rütted (6) - 1 freq litten (6) - 2 freq lutten (6) - 2 freq hüben (6) - 1 freq listen (6) - 491 freq blitzen (6) - 1 freq littcen (6) - 1 freq lïsten (6) - 11 freq looten (6) - 1 freq yüen (6) - 1 freq listnen (6) - 1 freq lhsten (6) - 1 freq latten (6) - 11 freq luntren (6) - 1 freq lettan (7) - 1 freq laitnin (7) - 1 freq lipton (7) - 8 freq ftzn (7) - 1 freq rötin (7) - 1 freq laitin (7) - 19 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 - LTSN littcen - 1 freq lützen - 1 freq |
LÜTZEN |
| Time to execute Levenshtein function - 0.379823 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.633674 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.071375 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.084895 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. |