polyleven 0.7__tar.gz → 0.9.0__tar.gz

{polyleven-0.7 → polyleven-0.9.0}/LICENSE

@@ -1,5 +1,8 @@
 Copyright (c) 2021 Fujimoto Seiji <fujimoto@ceptord.net>
 Copyright (c) 2021 Max Bachmann <kontakt@maxbachmann.de>
+Copyright (c) 2022 Nick Mazuk
+Copyright (c) 2022 Michael Weiss <code@mweiss.ch>
+Copyright (c) 2024 Alex Morgan <lexyym@gmail.com>
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

polyleven-0.9.0/PKG-INFO

@@ -0,0 +1,124 @@
+Metadata-Version: 2.2
+Name: polyleven
+Version: 0.9.0
+Summary: A fast C-implemented library for Levenshtein distance
+Maintainer-email: Fujimoto Seiji <fujimoto@ceptord.net>
+Project-URL: github, https://github.com/fujimotos/polyleven
+Keywords: Levenshtein distance
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: C
+Requires-Python: >=3.8
+Description-Content-Type: text/x-rst
+License-File: LICENSE
+
+==============================================
+Polyleven -- Fast Pythonic Levenshtein Library
+==============================================
+
+:License: MIT License
+
+1. Introduction
+===============
+
+polyleven is a Pythonic Levenshtein distance library that:
+
+- Is *fast* independent of input types, and hence can be used for
+  both short (like English words) and long input types (like DNA
+  sequences).
+
+- Is *stand-alone* depending only on core Python packages (such as
+  ``setuptools`` for installation).
+
+- Can be used readily in a manner not covered by restrictive
+  licenses such as GPL, hence can be used freely in private codes.
+
+2. How to install
+=================
+
+The official package is available on PyPI::
+
+  $ pip install polyleven
+
+3. How to use
+=============
+
+Polyleven provides a single interface function ``levenshtein()``. You
+can use this function to measure the similarity of two strings.
+
+>>> from polyleven import levenshtein
+>>> levenshtein('aaa', 'ccc')
+3
+
+If you only care about distances under a certain threshold, you can
+pass the max threshold to the third argument.
+
+>>> levenshtein('acc', 'ccc', 1)
+1
+>>> levenshtein('aaa', 'ccc', 1)
+2
+
+In general, you can gain a noticeable speed boost with threshold
+:math:`k < 3`.
+
+4. Benchmark
+============
+
+4.1  English Words
+------------------
+
+To compare Polyleven with other Pythonic edit distance libraries,
+a million word pairs was generated from `SCOWL`_.
+
+.. _SCOWL: http://wordlist.aspell.net/
+
+Each library was measured how long it takes to evaluate all of
+these words. The following table summarises the result:
+
+============================== ============ ================
+Function Name                    TIME[sec]    SPEED[pairs/s]
+============================== ============ ================
+edlib                                4.763           208216
+editdistance                         1.943           510450
+jellyfish.levenshtein_distance       0.722          1374081
+distance.levenshtein                 0.623          1591396
+Levenshtein.distance                 0.500          1982764
+polyleven.levenshtein                0.431          2303420
+============================== ============ ================
+
+4.2. Longer Inputs
+------------------
+
+To evaluate the efficiency for longer inputs, I created 5000 pairs
+of random strings of size 16, 32, 64, 128, 256, 512 and 1024.
+
+Each library was measured how fast it can process these entries. [#fn1]_
+
+============ =====  =====  =====  =====  =====  =====  ======
+Library      N=16   N=32   N=64   N=128  N=256  N=512  N=1024
+============ =====  =====  =====  =====  =====  =====  ======
+edlib        0.040  0.063  0.094  0.205  0.432  0.908   2.089
+editdistance 0.027  0.049  0.086  0.178  0.336  0.740  58.139
+jellyfish    0.009  0.032  0.118  0.470  1.874  8.877  42.848
+distance     0.007  0.029  0.109  0.431  1.726  6.950  27.998
+Levenshtein  0.006  0.022  0.085  0.336  1.328  5.286  21.097
+polyleven    0.003  0.005  0.010  0.043  0.149  0.550   2.109
+============ =====  =====  =====  =====  =====  =====  ======
+
+3.3. List of Libraries
+----------------------
+
+============ ======= ==========================================
+Library      Version URL
+============ ======= ==========================================
+edlib        v1.2.1  https://github.com/Martinsos/edlib
+editdistance v0.4    https://github.com/aflc/editdistance
+jellyfish    v0.5.6  https://github.com/jamesturk/jellyfish
+distance     v0.1.3  https://github.com/doukremt/distance
+Levenshtein  v0.12   https://github.com/ztane/python-Levenshtein
+polyleven    v0.3    https://github.com/fujimotos/polyleven
+============ ======= ==========================================
+
+.. [#fn1] Measured using Python 3.5.3 on Debian Jessie with Intel Core
+  i3-4010U (1.70GHz)

polyleven-0.9.0/README.rst

@@ -0,0 +1,109 @@
+==============================================
+Polyleven -- Fast Pythonic Levenshtein Library
+==============================================
+
+:License: MIT License
+
+1. Introduction
+===============
+
+polyleven is a Pythonic Levenshtein distance library that:
+
+- Is *fast* independent of input types, and hence can be used for
+  both short (like English words) and long input types (like DNA
+  sequences).
+
+- Is *stand-alone* depending only on core Python packages (such as
+  ``setuptools`` for installation).
+
+- Can be used readily in a manner not covered by restrictive
+  licenses such as GPL, hence can be used freely in private codes.
+
+2. How to install
+=================
+
+The official package is available on PyPI::
+
+  $ pip install polyleven
+
+3. How to use
+=============
+
+Polyleven provides a single interface function ``levenshtein()``. You
+can use this function to measure the similarity of two strings.
+
+>>> from polyleven import levenshtein
+>>> levenshtein('aaa', 'ccc')
+3
+
+If you only care about distances under a certain threshold, you can
+pass the max threshold to the third argument.
+
+>>> levenshtein('acc', 'ccc', 1)
+1
+>>> levenshtein('aaa', 'ccc', 1)
+2
+
+In general, you can gain a noticeable speed boost with threshold
+:math:`k < 3`.
+
+4. Benchmark
+============
+
+4.1  English Words
+------------------
+
+To compare Polyleven with other Pythonic edit distance libraries,
+a million word pairs was generated from `SCOWL`_.
+
+.. _SCOWL: http://wordlist.aspell.net/
+
+Each library was measured how long it takes to evaluate all of
+these words. The following table summarises the result:
+
+============================== ============ ================
+Function Name                    TIME[sec]    SPEED[pairs/s]
+============================== ============ ================
+edlib                                4.763           208216
+editdistance                         1.943           510450
+jellyfish.levenshtein_distance       0.722          1374081
+distance.levenshtein                 0.623          1591396
+Levenshtein.distance                 0.500          1982764
+polyleven.levenshtein                0.431          2303420
+============================== ============ ================
+
+4.2. Longer Inputs
+------------------
+
+To evaluate the efficiency for longer inputs, I created 5000 pairs
+of random strings of size 16, 32, 64, 128, 256, 512 and 1024.
+
+Each library was measured how fast it can process these entries. [#fn1]_
+
+============ =====  =====  =====  =====  =====  =====  ======
+Library      N=16   N=32   N=64   N=128  N=256  N=512  N=1024
+============ =====  =====  =====  =====  =====  =====  ======
+edlib        0.040  0.063  0.094  0.205  0.432  0.908   2.089
+editdistance 0.027  0.049  0.086  0.178  0.336  0.740  58.139
+jellyfish    0.009  0.032  0.118  0.470  1.874  8.877  42.848
+distance     0.007  0.029  0.109  0.431  1.726  6.950  27.998
+Levenshtein  0.006  0.022  0.085  0.336  1.328  5.286  21.097
+polyleven    0.003  0.005  0.010  0.043  0.149  0.550   2.109
+============ =====  =====  =====  =====  =====  =====  ======
+
+3.3. List of Libraries
+----------------------
+
+============ ======= ==========================================
+Library      Version URL
+============ ======= ==========================================
+edlib        v1.2.1  https://github.com/Martinsos/edlib
+editdistance v0.4    https://github.com/aflc/editdistance
+jellyfish    v0.5.6  https://github.com/jamesturk/jellyfish
+distance     v0.1.3  https://github.com/doukremt/distance
+Levenshtein  v0.12   https://github.com/ztane/python-Levenshtein
+polyleven    v0.3    https://github.com/fujimotos/polyleven
+============ ======= ==========================================
+
+.. [#fn1] Measured using Python 3.5.3 on Debian Jessie with Intel Core
+  i3-4010U (1.70GHz)

{polyleven-0.7 → polyleven-0.9.0}/polyleven.c

@@ -78,6 +78,9 @@ static int64_t mbleven_ascii(char *s1, int64_t len1,
         }
         c += (len1 - i) + (len2 - j);
         r = MIN(r, c);
+        if (r < 2) {
+            return r;
+        }
     }
     return r;
 }
@@ -124,6 +127,9 @@ static int64_t mbleven(PyObject *o1, PyObject *o2, int64_t k)
         }
         c += (s1.len - i) + (s2.len - j);
         r = MIN(r, c);
+        if (r < 2) {
+            return r;
+        }
     }
     return r;
 }

polyleven-0.9.0/polyleven.egg-info/PKG-INFO

@@ -0,0 +1,124 @@
+Metadata-Version: 2.2
+Name: polyleven
+Version: 0.9.0
+Summary: A fast C-implemented library for Levenshtein distance
+Maintainer-email: Fujimoto Seiji <fujimoto@ceptord.net>
+Project-URL: github, https://github.com/fujimotos/polyleven
+Keywords: Levenshtein distance
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: C
+Requires-Python: >=3.8
+Description-Content-Type: text/x-rst
+License-File: LICENSE
+
+==============================================
+Polyleven -- Fast Pythonic Levenshtein Library
+==============================================
+
+:License: MIT License
+
+1. Introduction
+===============
+
+polyleven is a Pythonic Levenshtein distance library that:
+
+- Is *fast* independent of input types, and hence can be used for
+  both short (like English words) and long input types (like DNA
+  sequences).
+
+- Is *stand-alone* depending only on core Python packages (such as
+  ``setuptools`` for installation).
+
+- Can be used readily in a manner not covered by restrictive
+  licenses such as GPL, hence can be used freely in private codes.
+
+2. How to install
+=================
+
+The official package is available on PyPI::
+
+  $ pip install polyleven
+
+3. How to use
+=============
+
+Polyleven provides a single interface function ``levenshtein()``. You
+can use this function to measure the similarity of two strings.
+
+>>> from polyleven import levenshtein
+>>> levenshtein('aaa', 'ccc')
+3
+
+If you only care about distances under a certain threshold, you can
+pass the max threshold to the third argument.
+
+>>> levenshtein('acc', 'ccc', 1)
+1
+>>> levenshtein('aaa', 'ccc', 1)
+2
+
+In general, you can gain a noticeable speed boost with threshold
+:math:`k < 3`.
+
+4. Benchmark
+============
+
+4.1  English Words
+------------------
+
+To compare Polyleven with other Pythonic edit distance libraries,
+a million word pairs was generated from `SCOWL`_.
+
+.. _SCOWL: http://wordlist.aspell.net/
+
+Each library was measured how long it takes to evaluate all of
+these words. The following table summarises the result:
+
+============================== ============ ================
+Function Name                    TIME[sec]    SPEED[pairs/s]
+============================== ============ ================
+edlib                                4.763           208216
+editdistance                         1.943           510450
+jellyfish.levenshtein_distance       0.722          1374081
+distance.levenshtein                 0.623          1591396
+Levenshtein.distance                 0.500          1982764
+polyleven.levenshtein                0.431          2303420
+============================== ============ ================
+
+4.2. Longer Inputs
+------------------
+
+To evaluate the efficiency for longer inputs, I created 5000 pairs
+of random strings of size 16, 32, 64, 128, 256, 512 and 1024.
+
+Each library was measured how fast it can process these entries. [#fn1]_
+
+============ =====  =====  =====  =====  =====  =====  ======
+Library      N=16   N=32   N=64   N=128  N=256  N=512  N=1024
+============ =====  =====  =====  =====  =====  =====  ======
+edlib        0.040  0.063  0.094  0.205  0.432  0.908   2.089
+editdistance 0.027  0.049  0.086  0.178  0.336  0.740  58.139
+jellyfish    0.009  0.032  0.118  0.470  1.874  8.877  42.848
+distance     0.007  0.029  0.109  0.431  1.726  6.950  27.998
+Levenshtein  0.006  0.022  0.085  0.336  1.328  5.286  21.097
+polyleven    0.003  0.005  0.010  0.043  0.149  0.550   2.109
+============ =====  =====  =====  =====  =====  =====  ======
+
+3.3. List of Libraries
+----------------------
+
+============ ======= ==========================================
+Library      Version URL
+============ ======= ==========================================
+edlib        v1.2.1  https://github.com/Martinsos/edlib
+editdistance v0.4    https://github.com/aflc/editdistance
+jellyfish    v0.5.6  https://github.com/jamesturk/jellyfish
+distance     v0.1.3  https://github.com/doukremt/distance
+Levenshtein  v0.12   https://github.com/ztane/python-Levenshtein
+polyleven    v0.3    https://github.com/fujimotos/polyleven
+============ ======= ==========================================
+
+.. [#fn1] Measured using Python 3.5.3 on Debian Jessie with Intel Core
+  i3-4010U (1.70GHz)

{polyleven-0.7 → polyleven-0.9.0}/polyleven.egg-info/SOURCES.txt

@@ -1,10 +1,10 @@
 LICENSE
 MANIFEST.in
-README.md
+README.rst
 polyleven.c
+pyproject.toml
 setup.py
 polyleven.egg-info/PKG-INFO
 polyleven.egg-info/SOURCES.txt
 polyleven.egg-info/dependency_links.txt
-polyleven.egg-info/not-zip-safe
 polyleven.egg-info/top_level.txt

polyleven-0.9.0/pyproject.toml

@@ -0,0 +1,26 @@
+[build-system]
+requires = ["setuptools"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "polyleven"
+version = "0.9.0"
+dependencies = []
+requires-python = ">= 3.8"
+maintainers = [
+  {name = "Fujimoto Seiji", email = "fujimoto@ceptord.net"}
+]
+description = "A fast C-implemented library for Levenshtein distance"
+readme = "README.rst"
+keywords = [
+    "Levenshtein distance"
+]
+classifiers = [
+    "Development Status :: 5 - Production/Stable",
+    "Operating System :: OS Independent",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: C",
+]
+
+[project.urls]
+github = "https://github.com/fujimotos/polyleven"

polyleven-0.9.0/setup.py

@@ -0,0 +1,7 @@
+import setuptools
+
+setuptools.setup(
+    ext_modules=[
+        setuptools.Extension('polyleven', sources=['polyleven.c'])
+    ]
+)

polyleven-0.7/PKG-INFO

@@ -1,67 +0,0 @@
-Metadata-Version: 2.1
-Name: polyleven
-Version: 0.7
-Summary: A fast C-implemented library for Levenshtein distance
-Home-page: http://ceptord.net/20181215-polyleven.html
-Author: Fujimoto Seiji
-Author-email: fujimoto@ceptord.net
-License: MIT License
-Project-URL: Documentation, http://ceptord.net/20181215-polyleven.html
-Project-URL: GitHub Mirror, https://github.com/fujimotos/polyleven
-Description: Polyleven
-        =========
-        
-        Polyleven is a fast Levenshtein distance library for Python.
-        
-        Project page: http://ceptord.net/20181215-polyleven.html
-        
-        Install
-        -------
-        
-            $ pip install polyleven
-        
-        Usage
-        -----
-        
-        Polyleven provides a single interface function "levenshtein()". You
-        can use this function to measure the similarity of two strings.
-        
-            >>> from polyleven import levenshtein
-            >>> levenshtein('aaa', 'ccc')
-            3
-        
-        If you only care about distances under a certain threshold, you can
-        pass the max threshold to the third argument.
-        
-            >>> levenshtein('acc', 'ccc', 1)
-            1
-            >>> levenshtein('aaa', 'ccc', 1)
-            2
-        
-        In general, you can gain a noticeable speed boost with threshold
-        k < 3.
-        
-        Source code
-        -----------
-        
-            git clone http://ceptord.net/cgit/polyleven/
-        
-        GitHub Mirror: https://github.com/fujimotos/polyleven
-        
-        Send bug reports to fujimoto@ceptord.net.
-        
-        License
-        -------
-        
-        From v0.7, polyleven is released under MIT License. See LICENSE for
-        the full license text.
-        
-Keywords: Levenshtein distance
-Platform: UNKNOWN
-Classifier: Development Status :: 4 - Beta
-Classifier: Operating System :: OS Independent
-Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: C
-Classifier: License :: OSI Approved :: MIT License
-Requires-Python: >=3.4
-Description-Content-Type: text/markdown

polyleven-0.7/README.md

@@ -1,47 +0,0 @@
-Polyleven
-=========
-
-Polyleven is a fast Levenshtein distance library for Python.
-
-Project page: http://ceptord.net/20181215-polyleven.html
-
-Install
--------
-
-    $ pip install polyleven
-
-Usage
------
-
-Polyleven provides a single interface function "levenshtein()". You
-can use this function to measure the similarity of two strings.
-
-    >>> from polyleven import levenshtein
-    >>> levenshtein('aaa', 'ccc')
-    3
-
-If you only care about distances under a certain threshold, you can
-pass the max threshold to the third argument.
-
-    >>> levenshtein('acc', 'ccc', 1)
-    1
-    >>> levenshtein('aaa', 'ccc', 1)
-    2
-
-In general, you can gain a noticeable speed boost with threshold
-k < 3.
-
-Source code
------------
-
-    git clone http://ceptord.net/cgit/polyleven/
-
-GitHub Mirror: https://github.com/fujimotos/polyleven
-
-Send bug reports to fujimoto@ceptord.net.
-
-License
--------
-
-From v0.7, polyleven is released under MIT License. See LICENSE for
-the full license text.

polyleven-0.7/polyleven.egg-info/PKG-INFO

@@ -1,67 +0,0 @@
-Metadata-Version: 2.1
-Name: polyleven
-Version: 0.7
-Summary: A fast C-implemented library for Levenshtein distance
-Home-page: http://ceptord.net/20181215-polyleven.html
-Author: Fujimoto Seiji
-Author-email: fujimoto@ceptord.net
-License: MIT License
-Project-URL: Documentation, http://ceptord.net/20181215-polyleven.html
-Project-URL: GitHub Mirror, https://github.com/fujimotos/polyleven
-Description: Polyleven
-        =========
-        
-        Polyleven is a fast Levenshtein distance library for Python.
-        
-        Project page: http://ceptord.net/20181215-polyleven.html
-        
-        Install
-        -------
-        
-            $ pip install polyleven
-        
-        Usage
-        -----
-        
-        Polyleven provides a single interface function "levenshtein()". You
-        can use this function to measure the similarity of two strings.
-        
-            >>> from polyleven import levenshtein
-            >>> levenshtein('aaa', 'ccc')
-            3
-        
-        If you only care about distances under a certain threshold, you can
-        pass the max threshold to the third argument.
-        
-            >>> levenshtein('acc', 'ccc', 1)
-            1
-            >>> levenshtein('aaa', 'ccc', 1)
-            2
-        
-        In general, you can gain a noticeable speed boost with threshold
-        k < 3.
-        
-        Source code
-        -----------
-        
-            git clone http://ceptord.net/cgit/polyleven/
-        
-        GitHub Mirror: https://github.com/fujimotos/polyleven
-        
-        Send bug reports to fujimoto@ceptord.net.
-        
-        License
-        -------
-        
-        From v0.7, polyleven is released under MIT License. See LICENSE for
-        the full license text.
-        
-Keywords: Levenshtein distance
-Platform: UNKNOWN
-Classifier: Development Status :: 4 - Beta
-Classifier: Operating System :: OS Independent
-Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: C
-Classifier: License :: OSI Approved :: MIT License
-Requires-Python: >=3.4
-Description-Content-Type: text/markdown

polyleven-0.7/polyleven.egg-info/not-zip-safe

@@ -1 +0,0 @@
-

polyleven-0.7/setup.py

@@ -1,33 +0,0 @@
-import setuptools
-
-with open('README.md') as fp:
-    README = fp.read()
-
-setuptools.setup(
-    name='polyleven',
-    version='0.7',
-    author='Fujimoto Seiji',
-    author_email='fujimoto@ceptord.net',
-    license='MIT License',
-    description='A fast C-implemented library for Levenshtein distance',
-    long_description=README,
-    long_description_content_type='text/markdown',
-    url='http://ceptord.net/20181215-polyleven.html',
-    ext_modules=[
-        setuptools.Extension('polyleven', sources=['polyleven.c'])
-    ],
-    project_urls={
-        'Documentation': 'http://ceptord.net/20181215-polyleven.html',
-        'GitHub Mirror': 'https://github.com/fujimotos/polyleven'
-    },
-    zip_safe=False,
-    python_requires='>=3.4',
-    keywords=['Levenshtein distance'],
-    classifiers=[
-        'Development Status :: 4 - Beta',
-        'Operating System :: OS Independent',
-        'Programming Language :: Python :: 3',
-        'Programming Language :: C',
-        'License :: OSI Approved :: MIT License'
-    ]
-)