Filewatcher File Search File Search
Content Search
» » » »


Package version:-


Welcome to String::Approx 3.0.

This release is a major update from String Approx 2,
of which 2.7 was the last release.  See later about the future
of version 2.

The most important change was that the underlying algorithm was
changed completely.  Instead of doing everything in Perl using regular
expressions we now do the matching in C using the so-called Manber-Wu
k-differences algorithm shift-ad


This code implements the basic 'bitap' algorithm for approximate
string matching, within "edit distance" (Levenshtein measure).  The
edit distance is defined as the total number of insertions, deletions,
and substitutions required to transfrom a string to (possibly a
substring of) another. "sale" is within 1 edit from "salve", "ale",
and "same", and within 2 edits from "fake".

The algorithm was d


Thu Nov 16 22:35:13 2000  Jarkko Hietaniemi  <>

	* Fixed the apse.c:_apse_match() for loop bug reported
	  by Ross Smith and Eric Promislow.

	* Add adist() and adistr() which tell the edit distance
	  and the relative edit distance.  For both zero is an exact match,
	  and negative means that the pattern is longer than the input.
	  For the relative edit distances 1 means that the stri


Copyright (C) Jarkko Hietaniemi, 1998. All Rights Reserved.

This program is free software; you can 


This material was developed by Sun Wu, Udi Manber and Burra Gopal
at the University of Arizona, Depa


Thu Nov 16 22:31:28 2000  Jarkko Hietaniemi  <>

	* Memory leak in amatch() reported

Browse inside libstring-approx-perl_3.14.orig.tar.gz

         [DIR]String-Approx-3.14/ (17)

Download libstring-approx-perl_3.14.orig.tar.gz

Results 1 - 1 of 1
Help - FTP Sites List - Software Dir.
Search over 15 billion files
© 1997-2016