Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!portc02.blue.aol.com!howland.erols.net!EU.net!usenet2.news.uk.psi.net!uknet!usenet1.news.uk.psi.net!uknet!uknet!bcc.ac.uk!news
From: Baber SHAH <zcacbss@cs.ucl.ac.uk>
Subject: soundex algorithm
Message-ID: <329F2E7C.41C67EA6@cs.ucl.ac.uk>
Date: Fri, 29 Nov 1996 18:42:04 GMT
Content-Transfer-Encoding: 7bit
Content-Type: text/plain; charset=us-ascii
Mime-Version: 1.0
X-Mailer: Mozilla 3.0 (X11; I; SunOS 4.1.3_U1 sun4c)
Organization: University College London
Lines: 16

Can anyone help ?


I'm currently working on a spell checker in Miranda and want to know if
it can be implemented using a Soundex algorithm.  The spell checker
would have a 50-60 word dictionary, but it would be designed to be
extended.  I'm planning on using simple pattern matching to check
whether a given input word is in the dictionary. 

Thanks for any useful input.





b.shah

