Parents (Total: 2)

The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
MD5	E53E899BD3BAF11E1C62DBC4F11C8B9C
PackageArch	x86_64
PackageDescription	String::Approx lets you match and substitute strings approximately. With this you can emulate errors: typing errorrs, speling errors, closely related vocabularies (colour color), genetic mutations (GAG ACT), abbreviations (McScot, MacScot). NOTE: String::Approx suits the task of *string matching*, not *string comparison*, and it works for *strings*, not for *text*. If you want to compare strings for similarity, you probably just want the Levenshtein edit distance (explained below), the Text::Levenshtein and Text::LevenshteinXS modules in CPAN. See also Text::WagnerFischer and Text::PhraseDistance. (There are functions for this in String::Approx, e.g. adist(), but their results sometimes differ from the bare Levenshtein et al.) If you want to compare things like text or source code, consisting of *words* or *tokens* and *phrases* and *sentences*, or *expressions* and *statements*, you should probably use some other tool than String::Approx, like for example the standard UNIX diff(1) tool, or the Algorithm::Diff module from CPAN. The measure of *approximateness* is the _Levenshtein edit distance_. It is the total number of "edits": insertions, word world deletions, monkey money and substitutions sun fun required to transform a string to another string. For example, to transform _"lead"_ into _"gold"_, you need three edits: lead gead goad gold The edit distance of "lead" and "gold" is therefore three, or 75%. *String::Approx* uses the Levenshtein edit distance as its measure, but String::Approx is not well-suited for comparing strings of different length, in other words, if you want a "fuzzy eq", see above. String::Approx is more like regular expressions or index(), it finds substrings that are close matches.>
PackageName	perl-String-Approx
PackageRelease	19.3
PackageVersion	3.28
SHA-1	44D8B91447CF5E731FBD980B591EB3BFF5E94083
SHA-256	885B38A05122EDD00183490E8CE1EEEBF25D1F813EEF3CECBA90E2F648163195

Key	Value
MD5	E4EA3744473654502F82342736FAD639
PackageArch	x86_64
PackageDescription	String::Approx lets you match and substitute strings approximately. With this you can emulate errors: typing errorrs, speling errors, closely related vocabularies (colour color), genetic mutations (GAG ACT), abbreviations (McScot, MacScot). NOTE: String::Approx suits the task of *string matching*, not *string comparison*, and it works for *strings*, not for *text*. If you want to compare strings for similarity, you probably just want the Levenshtein edit distance (explained below), the Text::Levenshtein and Text::LevenshteinXS modules in CPAN. See also Text::WagnerFischer and Text::PhraseDistance. (There are functions for this in String::Approx, e.g. adist(), but their results sometimes differ from the bare Levenshtein et al.) If you want to compare things like text or source code, consisting of *words* or *tokens* and *phrases* and *sentences*, or *expressions* and *statements*, you should probably use some other tool than String::Approx, like for example the standard UNIX diff(1) tool, or the Algorithm::Diff module from CPAN. The measure of *approximateness* is the _Levenshtein edit distance_. It is the total number of "edits": insertions, word world deletions, monkey money and substitutions sun fun required to transform a string to another string. For example, to transform _"lead"_ into _"gold"_, you need three edits: lead gead goad gold The edit distance of "lead" and "gold" is therefore three, or 75%. *String::Approx* uses the Levenshtein edit distance as its measure, but String::Approx is not well-suited for comparing strings of different length, in other words, if you want a "fuzzy eq", see above. String::Approx is more like regular expressions or index(), it finds substrings that are close matches.>
PackageName	perl-String-Approx
PackageRelease	lp152.19.3
PackageVersion	3.28
SHA-1	83507E87BCD7A0B66BD0D68B9DF6267EEFAC8EA0
SHA-256	A0D7A1DB89749D2EAC976FDFC08A213A8EB3099C42E85106CE2E8D4587E5A7F8