title: Morse without separators - best algorithm
body: <p>In Morse code there are <strong>dots</strong> and <strong>dashes</strong> in groups of 1-4 separated by a separator. Each group means one letter. Between words there are two separators. Between sentences three.</p>
  
  <p>Application for decrypting basic Morse code is quite easy to make. But my question is, how to solve the problem, when there are no separators? I know that there will be a huge amount of nonsense result but that's not my point. I only need to get all possible results in the most efficient way.</p>
  
  <p>This would be an input:</p>
  
  <pre><code>......-...-..---
  </code></pre>
  
  <p>And this would be one of many outputs:</p>
  
  <pre><code>hello
  </code></pre>
  
  <p>How would you do that?</p>