| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| denmark (0) - 19 freq kenmark (1) - 1 freq kenmairk (2) - 2 freq kenmarks (2) - 1 freq remark (2) - 43 freq denar (2) - 1 freq kenmerk (2) - 4 freq annmari (3) - 2 freq donnart (3) - 3 freq pentar (3) - 1 freq unmarkt (3) - 1 freq declare (3) - 24 freq €”mark (3) - 1 freq demans (3) - 1 freq entaik (3) - 1 freq almark (3) - 1 freq remarkt (3) - 7 freq enack (3) - 1 freq kenmairks (3) - 6 freq damart (3) - 1 freq weimar (3) - 1 freq denners (3) - 11 freq dark (3) - 378 freq derk (3) - 99 freq knark (3) - 1 freq |
denmark (0) - 19 freq kenmark (2) - 1 freq danemerk (3) - 3 freq kenmerk (3) - 4 freq kenmairk (3) - 2 freq denar (4) - 1 freq documark (4) - 3 freq remark (4) - 43 freq dunkirk (4) - 3 freq kenmarks (4) - 1 freq denier (5) - 1 freq apenwark (5) - 1 freq landmark (5) - 4 freq dunbar (5) - 48 freq damask (5) - 2 freq donard (5) - 1 freq openwark (5) - 3 freq primark (5) - 6 freq neymar (5) - 1 freq dener (5) - 2 freq remerk (5) - 3 freq helenmark (5) - 18 freq tidemark (5) - 2 freq dennir (5) - 29 freq delmaire (5) - 1 freq |
SoundEx code - D562 dauners - 5 freq denners - 11 freq denmark - 19 freq daunners - 1 freq doonricht - 9 freq dinner's - 1 freq diners - 1 freq dinners - 14 freq dounricht - 5 freq denarius - 1 freq denner's - 1 freq doonright - 2 freq dunragit - 1 freq dunracht - 10 freq dooners - 2 freq donor's - 1 freq denmark-norway - 2 freq deniers - 4 freq dunrossness - 1 freq deeners - 1 freq dawnrgraham - 1 freq dmrussell - 4 freq donmorrison - 1 freq donors - 1 freq downmarket - 3 freq |
MetaPhone code - TNMRK denmark - 19 freq danemerk - 3 freq |
DENMARK denmark - 19 freq dane - 55 freq |
| Time to execute Levenshtein function - 0.223254 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.359069 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.027868 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.038359 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. |