| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| damorn (0) - 6 freq damorns (1) - 1 freq damoarn (1) - 5 freq morn (2) - 389 freq acorn (2) - 2 freq eamonn (2) - 9 freq demon (2) - 23 freq damn (2) - 73 freq amon (2) - 23 freq i'morn (2) - 6 freq dampen (2) - 1 freq damien (2) - 2 freq damnin (2) - 2 freq amor (2) - 1 freq damoa (2) - 7 freq diamon (2) - 2 freq samoan (2) - 1 freq adorn (2) - 6 freq damson (2) - 1 freq tmorn (2) - 1 freq damo (2) - 10 freq darrn (2) - 1 freq damart (2) - 1 freq imorn (2) - 6 freq darn (2) - 3 freq |
damorn (0) - 6 freq damoarn (1) - 5 freq damorns (2) - 1 freq damson (3) - 1 freq adorn (3) - 6 freq tmorn (3) - 1 freq diamon (3) - 2 freq imorn (3) - 6 freq damian (3) - 2 freq damnin (3) - 2 freq damart (3) - 1 freq darrn (3) - 1 freq darn (3) - 3 freq i'morn (3) - 6 freq damn (3) - 73 freq morn (3) - 389 freq dampen (3) - 1 freq demon (3) - 23 freq damien (3) - 2 freq decern (4) - 2 freq domain (4) - 18 freq dooron (4) - 5 freq morna (4) - 12 freq demaun (4) - 1 freq mourn (4) - 14 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.234198 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.398539 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.027902 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.037348 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.000902 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. |