I implemented a spell checker using a Bloom filter at http://programmingpraxis.com/2009/04/21/probabilistic-spell-checking/.
On Mon, Jun 6, 2011 at 9:48 AM, Erich Rast <er...@snafu.de> wrote: > Hi, > > I need to check whether a given string already occurs in a list of > several million strings, where occasional false positives are > acceptable. > > Before reinventing the wheel, has anybody already implemented a > space-efficient Bloom filter in racket and would like to share it? > > Or, what else would you recommend? > > Best, > > Erich > > > > _________________________________________________ > For list-related administrative tasks: > http://lists.racket-lang.org/listinfo/users >
_________________________________________________ For list-related administrative tasks: http://lists.racket-lang.org/listinfo/users
