Global Information Lookup Global Information

Agrep information


agrep
Developer(s)
  • Udi Manber
  • Sun Wu
Initial release1988; 36 years ago (1988)
Stable release
3.41.5
Repository
  • github.com/Wikinaut/agrep Edit this at Wikidata
Written inC
Operating system
  • Unix-like
  • OS/2
  • DOS
  • Microsoft Windows
TypePattern matching
LicenseISC open source license
Websitewww.tgries.de/agrep

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]

  1. ^ 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.
  2. ^ WebGlimpse, Glimpse and also AGREP license since 18.09.2014 (ISC License).

and 11 Related for: Agrep information

Request time (Page generated in 0.5975 seconds.)

Agrep

Last Update:

agrep (approximate grep) is an open-source approximate string matching program, developed by Udi Manber and Sun Wu between 1988 and 1991, for use with...

Word Count : 316

Grep

Last Update:

tab, and introduced with InDesign CS4 in paragraph styles "GREP styles". agrep (approximate grep) matches even when the text only approximately fits the...

Word Count : 1455

Udi Manber

Last Update:

אודי מנבר) is an Israeli computer scientist. He is one of the authors of agrep and GLIMPSE. After a career in engineering and management, he worked on...

Word Count : 603

Approximate string matching

Last Update:

strings. The Bitap algorithm is the heart of the Unix searching utility agrep. A review of on-line searching algorithms was done by G. Navarro. Although...

Word Count : 1666

Levenshtein distance

Last Update:

greater than zero unless the strong exponential time hypothesis is false. agrep Damerau–Levenshtein distance diff Dynamic time warping Euclidean distance...

Word Count : 2432

Regular expression

Last Update:

uses BM for a first-pass prefiltering, and then uses an implicit DFA. Wu agrep, which implements approximate matching, combines the prefiltering into the...

Word Count : 8915

Bitap algorithm

Last Update:

perhaps best known as one of the underlying algorithms of the Unix utility agrep, written by Udi Manber, Sun Wu, and Burra Gopal. Manber and Wu's original...

Word Count : 1262

UnxUtils

Last Update:

supporting files (e.g. DLLs) in many cases. The utilities included are: agrep.exe ansi2knr.exe basename.exe bc.exe bison.exe bunzip2.exe bzip2.exe bzip2recover...

Word Count : 455

List of Jewish American computer scientists

Last Update:

States; Turing Award (2008) Udi Manber, Israeli-American computer scientist; agrep, GLIMPSE, suffix array, search engines John McCarthy, artificial intelligence...

Word Count : 1638

Levenshtein automaton

Last Update:

one, then compose these to implement edit distances up to some constant. agrep, tool (implemented several times) for approximate regular expression matching...

Word Count : 561

Index of combinatorics articles

Last Update:

algorithm Aho–Corasick string matching algorithm Fuzzy string searching grep, agrep, wildcard character Knuth–Morris–Pratt algorithm Sequences with zero autocorrelation...

Word Count : 626

PDF Search Engine © AllGlobal.net