Earlier quoted context omitted.
I think I'd have used a bloom filter for something like Letterpress.
I'm not seeing how a bloom filter would help you here. The only application of a bloom filter that I can see is checking whether or not the word candidate you generated is in a dictionary. All n-choose-k sets is enormous and you'd spend a very long time just generating the candidates. A prefix trie, as the GP mentioned, seems like a very good and obvious approach. You avoid most of the work generating non-words becau…
I haven't done any calculations or experiments, but it doesn't seem like you'd save much computation time with the bloom filter vs just using a hash table that maps (letter sets) -> (words). I could see this being faster than a trie, though, since you aren't trying to do spelling suggestions and you lose a lot of time traversing the trie for all possible permutations of the letters.