| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| damorn (0) - 6 freq damoarn (1) - 5 freq damorns (1) - 1 freq adorn (2) - 6 freq morn (2) - 386 freq amore (2) - 1 freq demon (2) - 22 freq damoa (2) - 7 freq samoan (2) - 1 freq damo (2) - 10 freq amon (2) - 22 freq diamon (2) - 2 freq damien (2) - 2 freq damian (2) - 2 freq acorn (2) - 2 freq tmorn (2) - 1 freq amor (2) - 1 freq i'morn (2) - 6 freq imorn (2) - 6 freq damn (2) - 73 freq darrn (2) - 1 freq darn (2) - 3 freq eamonn (2) - 9 freq damnin (2) - 2 freq damart (2) - 1 freq |
damorn (0) - 6 freq damoarn (1) - 5 freq damorns (2) - 1 freq darrn (3) - 1 freq damn (3) - 73 freq tmorn (3) - 1 freq darn (3) - 3 freq i'morn (3) - 6 freq damnin (3) - 2 freq damson (3) - 1 freq dampen (3) - 1 freq damart (3) - 1 freq damian (3) - 2 freq imorn (3) - 6 freq demon (3) - 22 freq adorn (3) - 6 freq diamon (3) - 2 freq morn (3) - 386 freq damien (3) - 2 freq moorn (4) - 1 freq demean (4) - 1 freq demaun (4) - 1 freq dooron (4) - 5 freq moarn (4) - 18 freq damagin (4) - 3 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 |
DAMORN |
| Time to execute Levenshtein function - 0.281982 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.590664 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.027410 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.069109 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.000805 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. |