1996-04-20 - Re: Dictionary searching code

Header Data

From: Michael B Herf <herf+@CMU.EDU>
To: adam@lighthouse.homeport.org>
Message Hash: 9f7b8f1f2db133aaab68a5da90d73a7486363663623e405b89d4bbf7b486a477
Message ID: <klS_BhG00iWY40oIYF@andrew.cmu.edu>
Reply To: <199604200102.UAA10156@homeport.org>
UTC Datetime: 1996-04-20 11:58:59 UTC
Raw Date: Sat, 20 Apr 1996 19:58:59 +0800

Raw message

From: Michael B Herf <herf+@CMU.EDU>
Date: Sat, 20 Apr 1996 19:58:59 +0800
To: adam@lighthouse.homeport.org>
Subject: Re: Dictionary searching code
In-Reply-To: <199604200102.UAA10156@homeport.org>
Message-ID: <klS_BhG00iWY40oIYF@andrew.cmu.edu>
MIME-Version: 1.0
Content-Type: text/plain



I have some anagram code that could be easily adapted to do what you
say.  Basically, it will find any anagram of a word exists in a
dictionary.  This means you can query an arbitrarily large dictionary at
>100 words per second.  

Actually, now that I think about it, it takes 2 seeks, but you could
remove one of them if you were doing a lot of queries.  (i.e. 1+n seeks
for n=number of words.)

Look at ftp://vivarin.res.cmu.edu/pub/scram

mike

Thread

• Return to April 1996

• Return to “Adam Shostack <adam@lighthouse.homeport.org>”
• Return to “Black Unicorn <unicorn@schloss.li>”
• Return to “Michael B Herf <herf+@CMU.EDU>”

• Return to “Simon Spero <ses@tipper.oit.unc.edu>”

• 1996-04-20 (Sat, 20 Apr 1996 13:54:02 +0800) - Dictionary searching code - Adam Shostack <adam@lighthouse.homeport.org>
  • 1996-04-20 (Sat, 20 Apr 1996 12:46:44 +0800) - Re: Dictionary searching code - Black Unicorn <unicorn@schloss.li>
  • 1996-04-20 (Sat, 20 Apr 1996 15:55:02 +0800) - Re: Dictionary searching code - Simon Spero <ses@tipper.oit.unc.edu>
  • 1996-04-20 (Sat, 20 Apr 1996 19:58:59 +0800) - Re: Dictionary searching code - Michael B Herf <herf+@CMU.EDU>