title: Ruby anagram solver
body: <p>I am wanting to write a anagram type solver in Ruby but it will work against a list of words, like so.</p>
  
  <p>List of words is:</p>
  
  <pre><code>the
  these
  one
  owner
  </code></pre>
  
  <p>I would allow the user to input some letters, e.g noe, and it would search the word list for words that it can make using the letters the user has input and would bring back <code>one</code> and if they entered "eth" or even "the" it would bring back <code>the</code>. I have been trying to think of a efficient way to do this but I have been looping around each word, match a letter in the word, checking the word for each letter and both lengths match.  Can anyone give advice of a better and more efficient way to do this?</p>