I implemented a spell checker using a Bloom filter at <a href="http://programmingpraxis.com/2009/04/21/probabilistic-spell-checking/">http://programmingpraxis.com/2009/04/21/probabilistic-spell-checking/</a>. <div class="gmail_quote"> On Mon, Jun 6, 2011 at 9:48 AM, Erich Rast <<a href="mailto:erich@snafu.de">erich@snafu.de</a>> wrote: <blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"> 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: <a href="http://lists.racket-lang.org/listinfo/users" target="_blank">http://lists.racket-lang.org/listinfo/users</a> </blockquote></div>