| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tmorn (0) - 1 freq morn (1) - 389 freq thorn (1) - 9 freq imorn (1) - 6 freq torn (1) - 51 freq tman (2) - 1 freq town (2) - 51 freq 'mon (2) - 12 freq voorn (2) - 1 freq thor (2) - 20 freq horn (2) - 59 freq mon (2) - 149 freq thorns (2) - 20 freq moron (2) - 4 freq morn- (2) - 4 freq kforn (2) - 1 freq porn (2) - 2 freq skorn (2) - 1 freq moran (2) - 8 freq moarn (2) - 18 freq tirn (2) - 35 freq morn' (2) - 3 freq taurn (2) - 1 freq mown (2) - 2 freq shorn (2) - 7 freq |
tmorn (0) - 1 freq morn (2) - 389 freq imorn (2) - 6 freq torn (2) - 51 freq thorn (2) - 9 freq timor (3) - 1 freq turn (3) - 818 freq moorn (3) - 1 freq tron (3) - 11 freq morna (3) - 12 freq taurn (3) - 1 freq i'morn (3) - 6 freq themorn (3) - 1 freq smorin (3) - 5 freq morin (3) - 2 freq murn (3) - 9 freq tirn (3) - 35 freq damorn (3) - 6 freq toarn (3) - 1 freq thern (3) - 1 freq troon (3) - 5 freq moarn (3) - 18 freq moron (3) - 4 freq thoarn (3) - 11 freq thorny (3) - 3 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.211920 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.377776 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.028227 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.038183 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.000978 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. |