This example reads a dictionary file containing one word per line,
constructs a Bloom filter with a 1% false positive rate, and
spellchecks its standard input. Like the Unix spell command, it
prints each word that it does not recognize.

Suggest a good combination of filter size and number of hash
functions for a Bloom filter, based on its expected maximum
capacity and a desired false positive rate.

The false positive rate is the rate at which queries against the
filter should return True when an element is not actually
present. It should be a fraction between 0 and 1, so a 1% false
positive rate is represented by 0.01.