X-Git-Url: http://git.indexdata.com/?a=blobdiff_plain;f=dict%2Flookgrep.c;h=03193ed839155bd65f7e8288525e842b2e1c9fd3;hb=07daef4fb241a9106fb995bb87a823708babcb10;hp=0820ffd12c2a95181f5fd03dcd2f8725a72d5788;hpb=05b9b8ed020c5bfa48a913d6a2e2b50ddf1bab8e;p=idzebra-moved-to-github.git

diff --git a/dict/lookgrep.c b/dict/lookgrep.c
index 0820ffd..03193ed 100644
--- a/dict/lookgrep.c
+++ b/dict/lookgrep.c
@@ -1,6 +1,6 @@
-/* $Id: lookgrep.c,v 1.28 2004-12-08 12:23:08 adam Exp $
-   Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002
-   Index Data Aps
+/* $Id: lookgrep.c,v 1.30 2005-11-01 10:16:08 adam Exp $
+   Copyright (C) 1995-2005
+   Index Data ApS
 
 This file is part of the Zebra server.
 
@@ -34,6 +34,16 @@ typedef unsigned MatchWord;
 #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 */