home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c
- From: raph@panache.demon.co.uk (Raphael mankin)
- Path: sparky!uunet!pipex!demon!panache.demon.co.uk!raph
- Subject: Re: Pattern Matching for Spelling Correction
- Distribution: world
- References: <1993Jan7.054651.25174@spartan.ac.BrockU.CA>
- Organization: Solvfield Ltd.
- Reply-To: raph@panache.demon.co.uk
- X-Mailer: Simple NEWS 1.90 (ka9q DIS 1.19)
- Lines: 20
- Date: Fri, 8 Jan 1993 20:22:37 +0000
- Message-ID: <726524557snz@panache.demon.co.uk>
- Sender: usenet@demon.co.uk
-
- In article <1993Jan7.054651.25174@spartan.ac.BrockU.CA> tmc@spartan.ac.BrockU.CA writes:
-
- >I'm currently working on the front-end to an information retrieval
- >package and would like to incorporate a facility to provide for
- >spelling correction. Does anyone have any recommendations for an
- >efficient pattern matching algorithm which could be used in this
- >capacity?
- >
- >The dictionary is rather large (but static) and I would prefer having
- >the option to search the entries either on disk or through a table
- >in memory.
- >
- Sorry to be so short tempered, but does no-one ever read the journals?
-
- CommACM Oct 1992 Vol 35 No 10. pp74-91
- and a whole host of others. Try your university library.
-
- --
- --------------
- Raphael Mankin Nil taurus excretum
-