| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tmorn (0) - 1 freq morn (1) - 386 freq thorn (1) - 9 freq torn (1) - 50 freq imorn (1) - 6 freq toor (2) - 7 freq tor (2) - 4 freq tman (2) - 1 freq quorn (2) - 1 freq damorn (2) - 6 freq smora (2) - 1 freq town (2) - 51 freq 'corn (2) - 1 freq norn (2) - 34 freq thord (2) - 3 freq thorns (2) - 20 freq sorn (2) - 28 freq moan (2) - 83 freq thora (2) - 1 freq 'mon (2) - 12 freq tore (2) - 69 freq moorn (2) - 1 freq tori (2) - 1 freq morn- (2) - 4 freq amore (2) - 1 freq |
tmorn (0) - 1 freq torn (2) - 50 freq imorn (2) - 6 freq thorn (2) - 9 freq morn (2) - 386 freq mourn (3) - 14 freq i'morn (3) - 6 freq thoarn (3) - 11 freq tern (3) - 1 freq toarn (3) - 1 freq morin (3) - 2 freq troon (3) - 5 freq thern (3) - 1 freq moron (3) - 4 freq timor (3) - 1 freq themorn (3) - 1 freq smorin (3) - 5 freq taurn (3) - 1 freq tirn (3) - 35 freq murn (3) - 9 freq morna (3) - 12 freq tron (3) - 11 freq thorny (3) - 2 freq turn (3) - 793 freq moran (3) - 8 freq |
SoundEx code - T565 the-morn - 2 freq tmorn - 1 freq themorn - 1 freq tynron's - 1 freq timmerin - 4 freq thunnerin - 1 freq tynron - 1 freq time-worn - 1 freq taniawren - 1 freq |
MetaPhone code - TMRN tmorn - 1 freq dammerin - 1 freq damoarn - 5 freq timmerin - 4 freq damorn - 6 freq |
TMORN |
| Time to execute Levenshtein function - 0.236269 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.722882 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.075988 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.097220 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.001112 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. |