projects
/
idzebra-moved-to-github.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
d317e36
)
Added note about the agrep algorithm used
author
Adam Dickmeiss
<adam@indexdata.dk>
Tue, 1 Nov 2005 10:16:08 +0000
(10:16 +0000)
committer
Adam Dickmeiss
<adam@indexdata.dk>
Tue, 1 Nov 2005 10:16:08 +0000
(10:16 +0000)
dict/lookgrep.c
patch
|
blob
|
history
diff --git
a/dict/lookgrep.c
b/dict/lookgrep.c
index
3473258
..
03193ed
100644
(file)
--- a/
dict/lookgrep.c
+++ b/
dict/lookgrep.c
@@
-1,4
+1,4
@@
-/* $Id: lookgrep.c,v 1.29 2005-01-15 19:38:21 adam Exp $
+/* $Id: lookgrep.c,v 1.30 2005-11-01 10:16:08 adam Exp $
Copyright (C) 1995-2005
Index Data ApS
Copyright (C) 1995-2005
Index Data ApS
@@
-34,6
+34,16
@@
typedef unsigned MatchWord;
#define WORD_BITS 32
#define MAX_LENGTH 1024
#define WORD_BITS 32
#define MAX_LENGTH 1024
+/* This code is based
+ * Sun Wu and Udi Manber: Fast Text Searching Allowing Errors.
+ * Communications of the ACM, pp. 83-91, Vol. 35, No. 10, Oct. 1992, USA.
+ * PostScript version of the paper in its submitted form: agrep1.ps)
+ * recommended reading to understand AGREP !
+ *
+ * http://www.tgries.de/agrep/#AGREP1PS
+ * http://www.tgries.de/agrep/doc/agrep1ps.zip
+ */
+
typedef struct {
int n; /* no of MatchWord needed */
int range; /* max no. of errors */
typedef struct {
int n; /* no of MatchWord needed */
int range; /* max no. of errors */