| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| damoarn (0) - 5 freq damorn (1) - 6 freq samoan (2) - 1 freq damart (2) - 1 freq damoa (2) - 7 freq damorns (2) - 1 freq damian (2) - 2 freq moarn (2) - 18 freq hameart (3) - 3 freq cmoan (3) - 1 freq mourn (3) - 14 freq damn (3) - 73 freq amara (3) - 1 freq tamara (3) - 16 freq daycoar (3) - 1 freq wamman (3) - 1 freq daars (3) - 1 freq aroart (3) - 1 freq dagmar (3) - 1 freq dartan (3) - 1 freq imorn (3) - 6 freq hammart (3) - 1 freq tamar (3) - 2 freq €™moan (3) - 7 freq amorra (3) - 2 freq |
damoarn (0) - 5 freq damorn (1) - 6 freq damian (3) - 2 freq damorns (3) - 1 freq moarn (3) - 18 freq damart (3) - 1 freq darn (4) - 3 freq dauran (4) - 1 freq domain (4) - 18 freq i'morn (4) - 6 freq deman (4) - 1 freq damien (4) - 2 freq daarin (4) - 1 freq tmorn (4) - 1 freq adorn (4) - 6 freq daarna (4) - 1 freq demon (4) - 23 freq dammerin (4) - 1 freq moorn (4) - 1 freq morn (4) - 389 freq damnin (4) - 2 freq demaun (4) - 1 freq damagin (4) - 3 freq damson (4) - 1 freq dampen (4) - 1 freq |
SoundEx code - D565 daunerin - 30 freq dannerin - 4 freq dammerin - 1 freq dunnerin - 8 freq daunnerin - 2 freq dennerin - 2 freq damoarn - 5 freq daanerin - 1 freq damorn - 6 freq damorns - 1 freq |
MetaPhone code - TMRN tmorn - 1 freq dammerin - 1 freq damoarn - 5 freq timmerin - 4 freq damorn - 6 freq |
DAMOARN |
| Time to execute Levenshtein function - 0.189365 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.350506 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.027205 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.036845 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.000925 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. |