| Developer(s) |
|
|---|---|
| Initial release | 1988 |
| Stable release | 3.41.5
|
| Repository | |
| Written in | C |
| Operating system | |
| Type | Pattern matching |
| License | ISC open source license |
| Website | www |
agrep (approximate grep) is an open-source approximate string matching program, developed by Udi Manber and Sun Wu between 1988 and 1991,[1] for use with the Unix operating system. It was later ported to OS/2, DOS, and Windows.
It selects the best-suited algorithm for the current query from a variety of the known fastest (built-in) string searching algorithms, including Manber and Wu's bitap algorithm based on Levenshtein distances.
agrep is also the search engine in the indexer program GLIMPSE. agrep is under a free ISC License.[2]
- ^ Wu, Sun; Manber, Udi (20–24 January 1992). Agrep -- a fast approximate pattern-matching tool. 1992 Winter USENIX Conference. San Francisco, California. CiteSeerX 10.1.1.89.5424.
- ^ WebGlimpse, Glimpse and also AGREP license since 18.09.2014 (ISC License).