| Name : perl-Text-WagnerFischer
| |
| Version : 0.04
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp155.7.1
| Date : 2023-07-20 18:54:17
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Text-WagnerFischer-0.04-lp155.7.1.src.rpm
|
| Size : 0.01 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : An implementation of the Wagner-Fischer edit distance
|
Description :
This module implements the Wagner-Fischer dynamic programming technique,
used here to calculate the edit distance of two strings. The edit distance
is a measure of the degree of proximity between two strings, based on
\"edits\": the operations of substitutions, deletions or insertions needed to
transform the string into the other one (and vice versa). A cost (weight)
is needed for every of the operation defined above:
/ a if x=y (cost for letter match)
w(x,y) = | b if x=- or y=- (cost for insertion/deletion operation)
\\ c if x!=y (cost for letter mismatch)
These costs are given through an array reference as first argument of the
distance subroutine: [a,b,c]. If the costs are not given, a default array
cost is used: [0,1,1] that is the case of the Levenshtein edit distance:
/ 0 if x=y (cost for letter match)
w(x,y) = | 1 if x=- or y=- (cost for insertion/deletion operation)
\\ 1 if x!=y (cost for letter mismatch)
This particular distance is the exact number of edit needed to transform
the string into the other one (and vice versa). When two strings have
distance 0, they are the same. Note that the distance is calculated to
reach the _minimum_ cost, i.e. choosing the most economic operation for
each edit.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-T/15.5/noarch |
