Path: utzoo!attcan!uunet!bu.edu!rpi!zaphod.mps.ohio-state.edu!ncar!gatech!rutgers!rochester!pt.cs.cmu.edu!dsl.pitt.edu!pitt!willett!ForthNet
From: ForthNet@willett.pgh.pa.us (ForthNet articles from GEnie)
Newsgroups: comp.lang.forth
Subject: other forth applications
Message-ID: <1892.UUL1.3#5129@willett.pgh.pa.us>
Date: 21 Oct 90 01:58:50 GMT
Organization: String, Scotch tape, and Paperclips.  (in Pgh, PA)
Lines: 31


 Date: 10-11-90 (12:10)              Number: 4034 (Echo)
   To: ZAFAR ESSAK                   Refer#: 3996
 From: GENE LEFAVE                     Read: NO
 Subj: SOUNDEX                       Status: PUBLIC MESSAGE

 I think the proper approach depends on the size of your list.  On our
 systems we rarely have more then 3000 names.   I'm using a straight
 string match on an alpha list.  I actually use the built in block
 editor from polyFORTH.  Then convert the located strings back into
 record numbers.   I've never had a user complaint this way, and they
 can find names usually with just three characters of the name.

 When I was using soundex I was always answering questions about why
 a totally unrelated name would come up.  And they always had to get
 the first letter right.

 Using the string search also lets them search on first names if it's
 unusual.

 I would only recommend soundex if your database is very large (>20,000)
 and then I would just display the hits.   It's pretty unlikely that
 a name with a close spelling does not hit.

 Another experiment I tried involved hashing but the results were so
 weird I'm still trying to think up a use for it.
 ---
  ~ EZ-Reader 1.13 ~ 
-----
This message came from GEnie via willett through a semi-automated process.
Report problems to: dwp@willett.pgh.pa.us or uunet!willett!dwp