Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| approximate string matching okrslar@informatik.uni-muenchen.de (Martin Okrslar) (2000-01-15) |
| Re: approximate string matching jrs@JustMakesSense.com (2000-01-15) |
| Re: approximate string matching rweaver@ix.netcom.com (2000-01-19) |
| Re: approximate string matching lionel_delafosse@mail.dotcom.fr (Lionel Delafosse) (2000-01-19) |
| Re: approximate string matching maratb@CS.Berkeley.EDU (Marat Boshernitsan) (2000-01-19) |
| Re: approximate string matching torbenm@diku.dk (2000-01-19) |
| From: | jrs@JustMakesSense.com (jrs) |
| Newsgroups: | comp.compilers |
| Date: | 15 Jan 2000 15:18:16 -0500 |
| Organization: | We're supposed to be organized? |
| References: | 00-01-044 |
| Keywords: | theory |
Martin Okrslar <okrslar@informatik.uni-muenchen.de> writes:
> Does anybody know of an implementation of approximate string matching?
I seem to remember a program called "agrep" (approximate grep)
that did this type of searching.
Don't remember where I found it, but should be in the search eng.
[Oh, right, it's part of the Glimpse package from the University of
Arizona. I use agrep and Glimpse for the full text indexes in the
comp.compilers archive. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.