-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I just finished coding up an implementation of the Wu-Manber k-difference approximate string matching algorithm. I'm a little unclear on how much 10% edit distance is ok and whether it might help things to re-run mismatches by swapping the pattern for the text. Ideas? Joshua b. Jore http://www.greentechnologist.org -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.6 (OpenBSD) Comment: For info see http://www.gnupg.org iD8DBQE8duxrfexLsowstzcRAozGAKDZkABmhLyprMG3DM384gG4RNm28ACaAmaJ VusCDHvi2ZSkueMW6AbIjEo= =iMsd -----END PGP SIGNATURE-----