Problem Statement
Encountered a continuous string of dots and dashes without spaces or slashes? Standard Morse code relies on inter-character pauses (1 element pause within characters, 3 element pause between letters). When pauses are removed, Morse code becomes ambiguous because it is not a prefix-free code. The UnMorse solver parses continuous dits and dahs across all valid branching combinations, ranking results using dictionary frequency analysis.
Solver Features
- Explores recursive letter-boundary splits for continuous, unspaced Morse code strings.
- Scores every possible candidate branch against high-frequency English lexicon tables.
- Supports arbitrary binary token substitutions (such as 0/1, A/B, or beep/boop pairs).
- Handles incomplete suffixes with optional partial-character detection for truncated transmissions.
Ambiguity and Search Tree Traversal
International Morse code (codified in ITU-R M.1677) has variable-length symbol representations, from 1 element (E: dot, T: dash) up to 5 elements (numbers). Because short symbols like dot (.) form prefixes for longer letters like A (.-) or S (...), removing letter delimiters creates an exponential tree of valid interpretations.
For example, the continuous sequence ..-. can be parsed as: 1. F (..-.) 2. IN (.. + -.) 3. ITE (.. + - + .) 4. ER (.. + .- + .) 5. EEAN (. + . + .- + -.)
The solver constructs a prefix-tree traversal over the input string. At each position, it tests valid symbol branches from length 1 to 4 against standard Latin mappings. Dead-end branches are pruned, and valid terminations are scored based on quadgram statistics and common dictionary vocabulary.
Solving Workflow
- Paste your unspaced sequence of dots and dashes into the search area.
- Configure custom tokens if your puzzle uses alternative symbols (like binary 0 and 1).
- Adjust the maximum results cap if working with sequences longer than 20 elements.
- Review the ranked candidates list. The most statistically coherent English candidate appears first.
Applications in Geocaching and Cryptanalysis
Unspaced Morse code is a staple in geocaching mystery caches and ARG puzzles. Solvers often receive audio samples where tone spacing was compressed or corrupted. By mapping continuous high and low tone lengths to binary tokens, solvers use UnMorse to recover waypoint coordinates without manual tree backtracking.
Algorithmic Limits and Exponential Growth
Because the branching factor averages approximately 2.3 branches per character, a 30-element unspaced Morse string can generate over 100,000 syntactically valid letter groupings. For strings longer than 25 elements, applying dictionary pruning during depth-first search is necessary to prevent browser memory exhaustion.
Frequently asked questions
Why is unspaced Morse code ambiguous?
Morse code is not a prefix code. A single dot can be the complete letter E or the start of letters like A, I, S, H, or U. Inter-character pauses are required for deterministic 1-pass parsing.
Can this tool solve non-English unspaced Morse?
The parser generates all syntactically valid combinations regardless of language. However, the automated ranking algorithm uses English language n-gram tables to sort candidates.
Related Tools
UnMorse transforms ambiguous dit-and-dah streams into ranked plaintext. To translate standard spaced transmissions, use our Morse code translator or test Tap code for grid-based telegraphy.