[racket] Need some help for my first real experiment with scheme

From: Sam Tobin-Hochstadt (samth at ccs.neu.edu)
Date: Wed Apr 18 10:34:42 EDT 2012

On Wed, Apr 18, 2012 at 10:21 AM, Neil Van Dyke <neil at neilvandyke.org> wrote:
> Pedro wrote at 04/17/2012 04:21 PM:
>> My first question is: which kind of kind of data structure should I
>> use in order to perform such a quick search? I'm guessing I should
>> split my notes' data into words and store each single word in some
>> kind of tree. But should I just jam every single word in the memory?
>> Is this a common practice?
> I think the subfield you're looking for is called "information retrieval",
> and there are textbooks on it.  You'll want to use multiple IR techniques
> together to get good search results.  (Although a simple stemming function
> and TFIDF will get you a long way.)  Which techniques you choose influences
> your choice of data structures / stores.

As a possible place to get started, I wrote a little TF-IDF program in
Racket a while back: https://gist.github.com/1157123 , based on a
similar one in Clojure.
sam th
samth at ccs.neu.edu

Posted on the users mailing list.