TRE 0.7.5

TRE is a robust, lightweight, and efficient POSIX compliant regexp matching library with some exciting features such as approximate (

Developer:	Ville Laurikari more software by author →
Price:	0.00
License:	LGPL (GNU Lesser General Public License)
File size:	485K
Language:
OS:
Rating:	0 /5 (0 votes)
Your vote:
enlarge screenshot

TRE is a robust, lightweight, and efficient POSIX compliant regexp matching library with some exciting features such as approximate (fuzzy) matching.

At the core of TRE is a new algorithm for regular expression matching with submatch addressing. The algorithm uses linear worst-case time in the length of the text being searched, and quadratic worst-case time in the length of the used regular expression.

In other words, the time complexity of the algorithm is O(M2N), where M is the length of the regular expression and N is the length of the text. The used space is also quadratic on the length of the regex, but does not depend on the searched string. This quadratic behaviour occurs only on pathological cases which are probably very rare in practice.

Here are some key features of "TRE":

TRE is not just yet another regexp matcher. TRE has some features which are not there in most free POSIX compatible implementations. Most of these features are not present in non-free implementations either, for that matter.

Approximate matching

Approximate pattern matching allows matches to be approximate, that is, allows the matches to be close to the searched pattern under some measure of closeness. TRE uses the edit-distance measure (also known as the Levenshtein distance) where characters can be inserted, deleted, or substituted in the searched text in order to get an exact match. Each insertion, deletion, or substitution adds the distance, or cost, of the match. TRE can report the matches which have a cost lower than some given threshold value. TRE can also be used to search for matches with the lowest cost.

TRE includes a version of the agrep (approximate grep) command line tool for approximate regexp matching in the style of grep. Unlike other agrep implementations (like the one by Sun Wu and Udi Manber from University of Arizona available here) TRE agrep allows full regexps of any length, any number of errors, and non-uniform costs for insertion, deletion and substitution.

What's New in This Release:

A Swedish translation has been added.

Documentation has been updated.

The -q command line option has been added.

A number of bugs have been fixed.
tags

the length has been the searched regular expression insertion deletion the matches tre can command line been added are not which are the algorithm case time

Download TRE 0.7.5

http://laurikari.net/tre/tre-0.7.5.tar.gz

http://laurikari.net/tre/tre-0.7.5.tar.bz2

Authors software

TRE 0.7.5 (by Ville Laurikari)
TRE is a robust, lightweight, and efficient POSIX compliant regexp matching library with some exciting features such as approximate (

Similar software

TRE 0.7.5 (by Ville Laurikari)
TRE is a robust, lightweight, and efficient POSIX compliant regexp matching library with some exciting features such as approximate (

Diqt 1.1.3 (by Mikio Hirabayashi)
Diqt is a Web-based multilingual dictionary reference tool

The Regex Coach 0.8.3 (by Dr. Edmund Weitz)
The Regex Coach is a graphical application which can be used to experiment with (Perl-compatible) regular expressions interactively.

Visual REGEXP 3.1 (by Laurent Riesterer)
Visual REGEXP project can easily design and debug regular expressions by providing a graphical visualization of the expression and it

glark 1.7.10 (by Jeff Pace)

XSearch 0.4.1 Alpha (by Adam Cottrell)
XSearch project bridges the gap between Beagle (simple interface, large search net) and find/grep (powerful searching, small search n

Levenshtein 0.10.1 (by David Necas)

File::Searcher 0.91 (by Adam Stubbs)
File::Searcher is a searches for files and performs search/replacements on matching files.

SYNOPSIS

use File::Searcher;

GNU Bool 0.2.1 (by Marc Tardif)
GNU Bool project is a utility for finding files that match a boolean expression.

The boolean operators supported are AND, OR and N

Redet 8.18 (by Bill Poser)
Redet also known as Regular Expression Development and Execution Tool is a tool for developing and executing regular expressions usin

Other software in this category

zlib 1.2.3 (by Jean-loup Gailly)
zlib is designed to be a free, general-purpose, legally unencumbered, lossless data-compression library for use on virtually any comp

libjpeg v6b (by Independent JPEG Group)
libjpeg is a library for handling the JPEG (JFIF) image format

OpenSSL 0.9.7c (by The OpenSSL Project Team)
The OpenSSL Project is a collaborative effort to develop a robust, commercial-grade, full-featured, and Open Source toolkit implement

libxml2 2.6.27 (by DV)
Libxml2 is the XML C parser and toolkit developed for the Gnome project (but usable outside of the Gnome platform), libxml2 library i

GNU C library 2.4 (by Andreas Jaeger)
GNU C library (glibc) is one of the most important components of GNU Hurd and most modern Linux distributions.

GNU C library is us