Man. I haven't seen one that will do that. That would be a shit load of spun versions if each of your spun words has say 6 alternatives. And you've got 100+ spun words in your article.
I'm not doing it for articles, I just want to get all the outcomes and plug them into another piece of software. I'm mainly doing sentences that are limited to 50-70 chars.
Needed something like this a couple months ago to input all possible outcomes in another tool as well, after searching the deepest parts of Google (read: about 2 pages deep), I finally gave up.
This also sounds like something that could be coded in less than 10 minutes, but then again I don't know shit about programming so maybe not.
where r is the number of bracketed sets, and n is the total number of terms across all bracketed sets. K is the number of sets which include 2 or more elements from the same bracketed set.
Scroll down to "Generating combinations of a set of elements"
There is a difference in your problem, though; you will need to make sure every set of r elements is made of exactly 1 element from each bracketed set. One way to do this is to group all the elements together in a particular order, so that the sets you want will be listed first, then you can kill the algorithm at that point.