AGREP - an approximate GREP.
Fast searching files for a string or regular expression, with approximate matching capabilities and user-definable records.
Developed 1989-1991 by Udi Manber, Sun Wu et al. at the University of Arizona.
search for "foo" in all files in the present directory:
agrep foo *
search for "miscelanos" within cost=3 errors (each insertion, deletion, or substitution costs "1"):
agrep -3 miscelanos *
built-in help:
agrep
Approximate Pattern Matching GREP -- Get Regular Expression
Usage:
AGREP [-#cdehi[a|#]klnprstvwxyABDGIRS] [-f patternfile] [-H dir] pattern [files]
-# find matches with at most # errors -A always output filenames
-b print byte offset of match
-c output the number of matched records -B find best match to the pattern
-d define record delimiter -Dk deletion cost is k
-e for use when pattern begins with - -G output the files with a match
-f name of file containing patterns -Ik insertion cost is k
-h do not display file names -Sk substitution cost is k
-i case-insensitive search; ISO <> ASCII -ia ISO chars mapped to lower ASCII
-i# digits-match-digits, letters-letters -i0 case-sensitive search
-k treat pattern literally - no meta-characters
-l output the names of files that contain a match
-n print line numbers of matches -q print buffer byte offsets
-p supersequence search -CP 850|437 set codepage
-r recurse subdirectories (UNIX style) -s silent
-t for use when delimiter is at the end of records
-v output those records without matches -V[012345V] version / verbose more
-w pattern has to match as a word: "win" will not match "wind"
-u unterdruecke record output -x pattern must match a whole line
-y suppresses the prompt when used with -B best match option
@listfile use the filenames in listfile <1>23456Q
The present repository contains three different branches.
- master: agrep based on agrep 3.0, ported to OS/2, DOS and Windows in the 90ies, and backported to LINUX (the present version you are visiting)
- agrep3.0-as-found-in-glimpse4.18.6-20130216: agrep 3.0 as it was found in the glimpse software
- agrep2.04: the first published and original agrep version
You can make a full or shallow clone of the repository:
git clone [email protected]:Wikinaut/agrep.git
git clone --depth 1 [email protected]:Wikinaut/agrep.git
cd agrep
make
- Wu, S., Manber, U.: "Agrep - A Fast Approximate Pattern-Matching Tool", 1992.
- Wu, S., Manber, U.: "Fast Text Searching With Errors", 1991.
- see agrep.algorithms
- see directory /docs
- see COPYRIGHT
This material was developed by Sun Wu, Udi Manber and Burra Gopal at the University of Arizona, Department of Computer Science. Permission is granted to copy this software, to redistribute it on a nonprofit basis, and to use it for any purpose, subject to the following restrictions and understandings.
-
Any copy made of this software must include this copyright notice in full.
-
All materials developed as a consequence of the use of this software shall duly acknowledge such use, in accordance with the usual standards of acknowledging credit in academic research.
-
The authors have made no warranty or representation that the operation of this software will be error-free or suitable for any application, and they are under under no obligation to provide any services, by way of maintenance, update, or otherwise. The software is an experimental prototype offered on an as-is basis.
-
Redistribution for profit requires the express, written permission of the authors.
- see agrep.chronicle
- TRE is a lightweight, robust, and efficient POSIX compliant regexp matching library with some exciting features such as approximate (fuzzy) matching.
- AGREPY: Python port of agrep string matching with errors
- The bitap library , another new and fresh implementation of the bitap algorithm. Windows - C - Cygwin
- PERL module String:Approx. Perl extension for approximate matching (fuzzy matching) by Jarkko Hietaniemi, Finland
- aGrep, published in 2012, is an Android implementation of
grep(but notagrep).
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent