In article <··········@news.u.washington.edu> ···@remora.cs.washington.edu (Mike Perkowitz) writes:
From: ···@remora.cs.washington.edu (Mike Perkowitz)
Newsgroups: comp.lang.lisp
Date: 30 Aug 1994 18:23:03 GMT
Organization: University of Washington Computer Science
Lines: 21
Distribution: world
i've checked the FAQ and looked over FTP sites (and tried querying the
keyword search at CMU -- nice system:) but havent been able to find
any package for common lisp that does agrep-style approximate matching.
by approximate matching, i mean the ability to compare strings (or
even regular expressions) allowing for some mistakes (different letters,
extra letters, and so on) -- usually, i think, you can specify how many
differences there can be and have it still count as a match.
any suggestions of where to look, what to keyword search for, or pointers
to actual packages would be appreciated.
I have not built it (I just read your posting), but a combination of
'do-symbols' with the nregex.lisp package in the Common Lisp Repository
(where you searched for the beast) should be a good first
approximation.
Hope it helps
--
Marco Antoniotti - Resistente Umano
-------------------------------------------------------------------------------
Robotics Lab | room: 1220 - tel. #: (212) 998 3370
Courant Institute NYU | e-mail: ·······@cs.nyu.edu
...e` la semplicita` che e` difficile a farsi.
...it is simplicity that is difficult to make.
Bertholdt Brecht