Switch from external, GPL Levenshtein library

ecoinvent_interface/release.py

@@ -8,10 +8,10 @@
 from typing import Optional
 
 import py7zr
-from Levenshtein import distance
 
 from .core import SYSTEM_MODELS, InterfaceBase, format_dict
 from .spold_versions import fix_version_meta, fix_version_upr, major_minor_from_string
+from .string_distance import damerau_levenshtein
 
 logger = logging.getLogger("ecoinvent_interface")
 
@@ -106,7 +106,10 @@ def get_release(
             # just easier to find the closest match and log the correction
             # than build a catalogue of exceptions.
             possible = sorted(
-                [(distance(filename, maybe), maybe) for maybe in available_files]
+                [
+                    (damerau_levenshtein(filename, maybe), maybe)
+                    for maybe in available_files
+                ]
             )[0]
             if possible[0] <= 3:
                 logger.info(

ecoinvent_interface/string_distance.py

@@ -0,0 +1,98 @@
+# From https://github.com/toastdriven/pylev/blob/main/pylev/damerau.py
+# Copyright (c) 2012, Daniel Lindsley
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are met:
+#
+#     * Redistributions of source code must retain the above copyright
+#       notice, this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above copyright
+#       notice, this list of conditions and the following disclaimer in the
+#       documentation and/or other materials provided with the distribution.
+#     * Neither the name of the pylev nor the
+#       names of its contributors may be used to endorse or promote products
+#       derived from this software without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL pylev BE LIABLE FOR ANY
+# DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+# ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+def damerau_levenshtein(string_1, string_2):
+    """
+    Calculates the Damerau-Levenshtein distance between two strings.
+
+    In addition to insertions, deletions and substitutions,
+    Damerau-Levenshtein considers adjacent transpositions.
+
+    This version is based on an iterative version of the Wagner-Fischer algorithm.
+
+    Usage::
+
+        >>> damerau_levenshtein('kitten', 'sitting')
+        3
+        >>> damerau_levenshtein('kitten', 'kittne')
+        1
+        >>> damerau_levenshtein('', '')
+        0
+
+    """
+    if string_1 == string_2:
+        return 0
+
+    len_1 = len(string_1)
+    len_2 = len(string_2)
+
+    if len_1 == 0:
+        return len_2
+    if len_2 == 0:
+        return len_1
+
+    if len_1 > len_2:
+        string_2, string_1 = string_1, string_2
+        len_2, len_1 = len_1, len_2
+
+    d0 = [i for i in range(len_2 + 1)]
+    d1 = [j for j in range(len_2 + 1)]
+    dprev = d0[:]
+
+    s1 = string_1
+    s2 = string_2
+
+    for i in range(len_1):
+        d1[0] = i + 1
+        for j in range(len_2):
+            cost = d0[j]
+
+            if s1[i] != s2[j]:
+                # substitution
+                cost += 1
+
+                # insertion
+                x_cost = d1[j] + 1
+                if x_cost < cost:
+                    cost = x_cost
+
+                # deletion
+                y_cost = d0[j + 1] + 1
+                if y_cost < cost:
+                    cost = y_cost
+
+                # transposition
+                if i > 0 and j > 0 and s1[i] == s2[j - 1] and s1[i - 1] == s2[j]:
+                    transp_cost = dprev[j - 1] + 1
+                    if transp_cost < cost:
+                        cost = transp_cost
+            d1[j + 1] = cost
+
+        dprev, d0, d1 = d0, d1, dprev
+
+    return d0[-1]

pyproject.toml

@@ -23,7 +23,6 @@ classifiers = [
 ]
 requires-python = ">=3.9"
 dependencies = [
-    "levenshtein",
     "lxml",
     "platformdirs",
     "py7zr",