Key | Value |
---|---|
FileName | ./usr/lib/perl5/vendor_perl/5.26.1/x86_64-linux-thread-multi/auto/String/Approx/Approx.so |
FileSize | 45248 |
MD5 | 7E2BB210B93C8AB9A5079DEB8EBECA15 |
SHA-1 | DA428744903632A2C575926B270DC24170BE7403 |
SHA-256 | CCF4704BF0187AD933D1342E5FE008A1F8330350051B2C6A2F1CE8DC8B6F09DF |
SSDEEP | 768:HweA+g8fqJQ81yXyxR5VcR+K/gUOGZJlg2PdvFz4Ppryl6faSuXOO0HNrq:HweqhkR4rO82PdvFEk6xrq |
TLSH | T1C1130B06F67688BFC8D6EA304EE74AB6797035C553394A3F6108473D2A46E1C0E27E67 |
hashlookup:parent-total | 2 |
hashlookup:trust | 60 |
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 | B0BFCFC433227E332825D57C27F9521D |
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 | lp153.19.9 |
PackageVersion | 3.28 |
SHA-1 | 55711A13F4ED67C42E1DDADA6D53D59F2424B1FC |
SHA-256 | 35CC2EE34FC7AA41D13F17DC4BB44CA57E5533229C340458E023332357C12B2F |
Key | Value |
---|---|
MD5 | D715D42CFA3FEFE3FC4E65CA3D8DEE9F |
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.> |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | perl-String-Approx |
PackageRelease | bp153.1.16 |
PackageVersion | 3.28 |
SHA-1 | 4BF4DFE3390C92C74F2EE0FD88363477DE0A43AA |
SHA-256 | E4D89A2120A700B69BFA93E9676EDDB8CB2BE0AF460CB7F3F360FAED05DDAC1C |