| Paketname | libagrep-ocaml |
| Beschreibung | Wu-Manber algorithm for string searching with errors |
| Archiv/Repository | Offizielles Debian Archiv squeeze (main) |
| Version | 1.0-11+b1 |
| Sektion | ocaml |
| Priorität | optional |
| Installierte Größe | 56 Byte |
| Hängt ab von | ocaml-base-nox-3.11.2, libc6 (>= 2.1.3) |
| Empfohlene Pakete | |
| Paketbetreuer | Debian OCaml Maintainers |
| Quelle | ocamlagrep (1.0-11) |
| Paketgröße | 8084 Byte |
| Prüfsumme MD5 | eb45a72995a08e3826ea8910c3a8ccc1 |
| Prüfsumme SHA1 | b49749d395cde1b05c8c1545c67b5d8274e8a85e |
| Prüfsumme SHA256 | 67808190cf91843163f959d912786c8e5ed939e2c65355c8edf6b030743cebec |
| Link zum Herunterladen | libagrep-ocaml_1.0-11+b1_i386.deb |
| Ausführliche Beschreibung | This OCaml library implements the Wu-Manber algorithm for string searching
with errors, popularized by the "agrep" Unix command and the "glimpse" file
indexing tool. It was developed as part of a search engine for a largish MP3
collection; the "with error" searching comes handy for those who can't spell
Liszt or Shostakovitch.
.
Given a search pattern and a string, this algorithm determines whether the
string contains a substring that matches the pattern up to a parameterizable
number N of "errors". An "error" is either a substitution (replace a
character of the string with another character), a deletion (remove a
character) or an insertion (add a character to the string). In more
scientific terms, the number of errors is the Levenshtein edit distance
between the pattern and the matched substring.
.
The search patterns are roughly those of the Unix shell, including
one-character wildcard (?), character classes ([0-9]) and multi-character
wildcard (*). In addition, conjunction (&) and alternative (|) are supported.
General regular expressions are not supported, however.
.
This package contains only the shared runtime stub libraries.
|