Find anagrams in a list
Looks good! Just one little thing that I, personally would do to remove one .toLowerCase call per item: map it first. So, instead of calling .toLowerCase in the filter, you can do this:

words.map(w =&gt; w.toLowerCase)
     .filter(w =&gt; w.sorted == sorted_word &amp;&amp; w != origin_word)


You've also got a random newline before the end of the class.

Aside from that little niggle, it looks good! There's... really not much I can say. It's short code.