Yes, I know there is a similar question, but this one specifically concerns any possible words, even with letters left over, while the linked one restricts to a permutation of the input
Have you ever had those moments in a Scrabble game where you're staring at your letters, trying to find a good word, and your mind is just blank? Some of us feel cheaty and turn to word unscrambling software like this one to help us. This challenge is to build your own word unscrambler.
Given a list of possible words and a string of characters conforming to the regex
([A-Z]|[a-z])+, your program has to find all the words whose letters are all found in the scrambled string.
asto, [as, so, to, oats] -> [as, so, to, oats] asto, [as, to] -> [as, to] ast, [as, so, to] -> [as] zzyzx, [as, to, so] ->  trom, [as, to, too, or] -> [to, or] roomt, [as, to, too, or] -> [to, too, or]
This is code-golf, shortest answer wins.