See also: Granma loves Ana
You will be given a string of lowercase ASCII letters. Using this dictionary file (UPDATED), your task is to solve the anagram. To solve an anagram, you must output all words or groups of words that can be formed using each letter from the input string exactly once, separated by newlines. Groups of the same words in a different order are not unique and should not be output separately; however, the order of the words does not matter. The order of output solutions also does not matter. If the input cannot form a word, output nothing.
Some useful test cases:
Input: viinlg Output: living Input: fceodglo Output: code golf Input: flogflog Output: golf golf Input: ahwhygi Output: highway high way Input: bbbbbb Output:
You may access the dictionary list any way you like. Command line argument, stdin, reading from file, or reading from internet are all acceptable.
Input will consist of lowercase ASCII letters only. You are not required to output results in any particular case.
You will not be given a string that already forms a valid word (you may, however, be given a string that forms multiple words, such as
Trailing newlines are allowed but not required.
Standard loopholes apply.
This is code-golf. Shortest code in bytes wins. Good luck!