Key | Value |
---|---|
FileName | snap-hashlookup-import/usr/share/doc/python3-levenshtein/Levenshtein.html |
FileSize | 16129 |
MD5 | 3584EE95515C12B8B521CAC2486A4C59 |
SHA-1 | 1DDEA117B13C9DFF7C100E157BE6A7EDE93B4455 |
SHA-256 | 7EDDE3A9F301A772723C7A971241456B27ED9D010113F94BB93C430A027759B4 |
SHA-512 | CB03A27AE975B8DD7FF290FB36176ED5F33B3CAFBE1DF1995FB3105260C86380DF558DA61B0887DADF7A9FA683362303BBBEACE58BEDACA578E98CFFA3B8F091 |
SSDEEP | 192:gkC9CEXUXl4MIJtpswVXl7m45o91BCH7DT2/S:gkC9CEXUXlpIJt1dm4+HBCH7DTwS |
TLSH | T1917294EE569B33D729D2463EDFEA38845339800A91F060EDBCDC4194B74AB0469F6C6D |
insert-timestamp | 1727055015.9929793 |
mimetype | text/html |
source | snap:wBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_33 |
hashlookup:parent-total | 68 |
hashlookup:trust | 100 |
The searched file hash is included in 68 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 36622 |
MD5 | 5EF9D7CC86A659D97FA25A96A7E72975 |
PackageDescription | extension for computing string similarities and edit distances The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. |
PackageMaintainer | Sandro Tosi <morph@debian.org> |
PackageName | python-levenshtein |
PackageSection | python |
PackageVersion | 0.12.0-2+b2 |
SHA-1 | 156D0C3EC243F11E82CA6755A45F0A6B35DE84A0 |
SHA-256 | AF76A04DEF908CE1568794001670FA0A8E44581BDD1A8E59EA8FE3A6212E4917 |
Key | Value |
---|---|
SHA-1 | 193D4897A223717A11ACAB916F35D7F7421D95D1 |
snap-authority | canonical |
snap-filename | wBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_22.snap |
snap-id | wBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_22 |
snap-name | rapunzel |
snap-publisher-id | iF39jGin6mL9yavM0mp1QbryMUfExcYE |
snap-signkey | BWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul |
snap-timestamp | 2021-03-04T12:32:37.365593Z |
source-url | https://api.snapcraft.io/api/v1/snaps/download/wBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_22.snap |
Key | Value |
---|---|
MD5 | 9FF91DCBC68BDF5A53625E5F4EA2A271 |
PackageArch | i586 |
PackageDescription | The Levenshtein Python 3 C extension module contains functions for fast computation of - Levenshtein (edit) distance, and edit operations - string similarity - approximate median strings, and generally string averaging - string sequence and set similarity It supports both normal and Unicode strings. |
PackageMaintainer | umeabot <umeabot> |
PackageName | python3-levenshtein |
PackageRelease | 11.mga9 |
PackageVersion | 0.12.0 |
SHA-1 | 1DF65C007CDFA24324A8A12BF0F9C429F033AD3F |
SHA-256 | 15AB4EC6657BD2B5320826BB8840C8CEC8DABD1DE5CC41C996DFB16CA616B4B0 |
Key | Value |
---|---|
MD5 | E523E5DA816FA51272462361F5498EFE |
PackageArch | armv7hl |
PackageDescription | The Levenshtein Python 3 C extension module contains functions for fast computation of - Levenshtein (edit) distance, and edit operations - string similarity - approximate median strings, and generally string averaging - string sequence and set similarity It supports both normal and Unicode strings. |
PackageMaintainer | umeabot <umeabot> |
PackageName | python3-levenshtein |
PackageRelease | 8.mga8 |
PackageVersion | 0.12.0 |
SHA-1 | 211186BD16B987F3FD1557B1959F998EDC02DC44 |
SHA-256 | 418222A3EAEBEC0292D091C8C2471FAC16B4A571FF0561DAC1DA4C672702DACE |
Key | Value |
---|---|
MD5 | F57B9F159F8CE81117280B78E07296C7 |
PackageArch | armv7hl |
PackageDescription | The Levenshtein Python C extension module contains functions for fast computation of - Levenshtein (edit) distance, and edit operations - string similarity - approximate median strings, and generally string averaging - string sequence and set similarity It supports both normal and Unicode strings. |
PackageMaintainer | tv <tv> |
PackageName | python-levenshtein |
PackageRelease | 5.mga7 |
PackageVersion | 0.12.0 |
SHA-1 | 25ECEF2B9A4072E8DCD17768CF6C739051BD0C37 |
SHA-256 | F9423D99CC997BF4E99B5DC738EE6C29B91A75F43D3CDC53890B6355B54A8AC9 |
Key | Value |
---|---|
FileSize | 36736 |
MD5 | D15928AA514881E585ACDD5C62B28AE2 |
PackageDescription | extension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3. |
PackageMaintainer | Sandro Tosi <morph@debian.org> |
PackageName | python3-levenshtein |
PackageSection | python |
PackageVersion | 0.12.2-1 |
SHA-1 | 267B46156D37EB81B019E4E0582890655BE640AF |
SHA-256 | 3151A1FAA17B08B68512831F820381F9A9941A1878F8ABF0C881809FB75C888B |
Key | Value |
---|---|
FileSize | 37180 |
MD5 | 06135EB9473837952629DF2AA25CF99F |
PackageDescription | extension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3. |
PackageMaintainer | Sandro Tosi <morph@debian.org> |
PackageName | python3-levenshtein |
PackageSection | python |
PackageVersion | 0.12.2-1 |
SHA-1 | 2956FEB1636D149690EA508E18C6ADCC4F773C10 |
SHA-256 | 4EF6A72839F3DE7944E23C8258359C9CBBE99D18CEE18D8C8B4FA303AC4444FC |
Key | Value |
---|---|
MD5 | CDE97E25720843EA65C674E4078AF289 |
PackageArch | armv7hl |
PackageDescription | The Levenshtein Python 3 C extension module contains functions for fast computation of - Levenshtein (edit) distance, and edit operations - string similarity - approximate median strings, and generally string averaging - string sequence and set similarity It supports both normal and Unicode strings. |
PackageMaintainer | tv <tv> |
PackageName | python3-levenshtein |
PackageRelease | 5.mga7 |
PackageVersion | 0.12.0 |
SHA-1 | 2B0F34B6DBFB592691331EC0BCA1A58AC00BC126 |
SHA-256 | 5CC16603546B086586F16577D3310A9EA6E2BDE714F6816128D2DE60133A2ECE |
Key | Value |
---|---|
FileSize | 39092 |
MD5 | 84E6C5A8FFA4E92ADA49395E7B771414 |
PackageDescription | extension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3. |
PackageMaintainer | Sandro Tosi <morph@debian.org> |
PackageName | python3-levenshtein |
PackageSection | python |
PackageVersion | 0.12.2-1 |
SHA-1 | 356D7968732A42544E91A6FF750BB4CE6330687B |
SHA-256 | 853C662EEF6C244AB035BEB4A657C047AD7DC0D81A28C62F48ECB477E2F549B1 |
Key | Value |
---|---|
FileSize | 36292 |
MD5 | E5D5A259082B04BA22D2A581156EF52C |
PackageDescription | extension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3. |
PackageMaintainer | Sandro Tosi <morph@debian.org> |
PackageName | python3-levenshtein |
PackageSection | python |
PackageVersion | 0.12.2-2 |
SHA-1 | 38D61261C4D80778C6AF56D5D575801DEDC44A00 |
SHA-256 | 225A8205D338D082C62A606760015233C23FC99D3EC2BCCE33A60BFF0E46AC11 |