> I have a feeling this blows up pretty fast, computationally. Of course it does, but there's no way to compute the number without checking all combinations. T

> I have a feeling this blows up pretty fast, computationally. Of course it does, but there's no way to compute the number without checking all combinations. There are hundreds of thousands of English words, and about the only initial filtering you can do is remove words with more than one q. Each partition will contain at least 20 words, so have >20! permutations.