| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| themorra (0) - 24 freq the-morra (1) - 2 freq themarra (1) - 1 freq emorra (2) - 1 freq themorn (2) - 1 freq themorra's (2) - 4 freq the-morras (2) - 1 freq theeerr (3) - 1 freq theorem (3) - 1 freq morra (3) - 76 freq theory (3) - 32 freq stemorry (3) - 1 freq thora (3) - 1 freq tremor (3) - 3 freq therr (3) - 11 freq the-morn (3) - 2 freq therrr (3) - 1 freq themirk (3) - 1 freq ramorra (3) - 1 freq theworld (3) - 1 freq thewords (3) - 1 freq themole (3) - 1 freq torra (3) - 2 freq terra (3) - 1 freq amorra (3) - 2 freq |
themorra (0) - 24 freq themarra (1) - 1 freq the-morra (2) - 2 freq themorn (3) - 1 freq therrr (4) - 1 freq tharra (4) - 1 freq themirk (4) - 1 freq the-morras (4) - 1 freq emorra (4) - 1 freq theeerr (4) - 1 freq themorra's (4) - 4 freq therr (4) - 11 freq terra (5) - 1 freq thesaurar (5) - 1 freq torra (5) - 2 freq thurr (5) - 6 freq thumper (5) - 1 freq amorra (5) - 2 freq themole (5) - 1 freq theorem (5) - 1 freq stemorry (5) - 1 freq morra (5) - 76 freq theory (5) - 32 freq tremor (5) - 3 freq thora (5) - 1 freq |
SoundEx code - T560 thunner - 73 freq thinner - 14 freq the-morra - 2 freq tanner - 10 freq tomorrow - 41 freq timmer - 77 freq tenure - 4 freq tumour - 6 freq themorra - 24 freq tenner - 25 freq thonner - 45 freq 'thonner - 1 freq thonner' - 1 freq toner - 1 freq timer - 6 freq tamar - 2 freq ten'er - 1 freq 'tamara - 1 freq tamara - 16 freq tamer - 2 freq themarra - 1 freq thoner - 2 freq tenor - 4 freq tuner - 1 freq tomorrow' - 1 freq twa-hunner - 1 freq tonner - 1 freq thoumire - 2 freq thunnery - 1 freq to-morrow - 1 freq €˜thonner - 1 freq tinner - 1 freq €œtomorrow - 1 freq tenior - 1 freq tommorrow - 1 freq twa-hauner - 1 freq tamhere - 1 freq timor - 1 freq |
MetaPhone code - 0MR the-morra - 2 freq themorra - 24 freq themarra - 1 freq thoumire - 2 freq |
THEMORRA |
| Time to execute Levenshtein function - 0.226903 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.356172 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.035835 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.046872 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.001068 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. |