1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
Source: ocamlagrep
Section: devel
Priority: optional
Maintainer: Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
Uploaders: Samuel Mimram <smimram@debian.org>
Build-Depends: debhelper (>= 4.0.0), ocaml-nox (>= 3.09.1)
Standards-Version: 3.7.2
Package: libagrep-ocaml-dev
Section: libdevel
Architecture: any
Depends: libagrep-ocaml (= ${Source-Version}), ocaml-nox-${F:OCamlABI}
Description: Wu-Manber algorithm for string searching with errors
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 all the development stuff you need to use
the agrep OCaml library in your programs.
Package: libagrep-ocaml
Section: libs
Architecture: any
Depends: ocaml-base-nox-${F:OCamlABI}, ${shlibs:Depends}
Description: Wu-Manber algorithm for string searching with errors
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.
|
