Recursive generator for combinations of a multiset?

Dan Stromberg drsalists at gmail.com
Thu Nov 21 21:59:26 CET 2013


On Wed, Nov 20, 2013 at 10:46 PM, John O'Hagan <research at johnohagan.com>wrote:

>
> Short story: the subject says it all, so if you have an answer already,
> fire away. Below is the long story of what I'm using it for, and why I
> think it needs to be recursive. It may even be of more general
> interest in terms of filtering the results of generators.
>

I think you probably need permutations rather than combinations.

Also, I think you'll need to form a word (partitioned off by spaces), and
then check it against a set containing /usr/share/dict/words before
recursing for the remainder of the sentence - this should speed things up a
LOT.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/python-list/attachments/20131121/f83715bb/attachment.html>


More information about the Python-list mailing list