strsimpy 0.4.0__cp310-abi3-win_amd64.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- strsimpy/__init__.py +67 -0
- strsimpy/_base.py +126 -0
- strsimpy/_strsimpy.pyd +0 -0
- strsimpy/cosine.py +5 -0
- strsimpy/damerau.py +5 -0
- strsimpy/jaccard.py +5 -0
- strsimpy/jaro_winkler.py +5 -0
- strsimpy/levenshtein.py +5 -0
- strsimpy/longest_common_subsequence.py +5 -0
- strsimpy/metric_lcs.py +5 -0
- strsimpy/ngram.py +5 -0
- strsimpy/normalized_levenshtein.py +5 -0
- strsimpy/optimal_string_alignment.py +5 -0
- strsimpy/overlap_coefficient.py +5 -0
- strsimpy/qgram.py +5 -0
- strsimpy/shingle_based.py +5 -0
- strsimpy/sift4.py +5 -0
- strsimpy/sorensen_dice.py +5 -0
- strsimpy/string_distance.py +9 -0
- strsimpy/string_similarity.py +5 -0
- strsimpy/weighted_levenshtein.py +23 -0
- strsimpy-0.4.0.dist-info/METADATA +541 -0
- strsimpy-0.4.0.dist-info/RECORD +26 -0
- strsimpy-0.4.0.dist-info/WHEEL +4 -0
- strsimpy-0.4.0.dist-info/licenses/LICENSE +21 -0
- strsimpy-0.4.0.dist-info/sboms/strsimpy-py.cyclonedx.json +574 -0
strsimpy/__init__.py
ADDED
|
@@ -0,0 +1,67 @@
|
|
|
1
|
+
"""Rust-backed string similarity and distance measures.
|
|
2
|
+
|
|
3
|
+
The public API is unchanged: every class can be imported from the package
|
|
4
|
+
root, and the historical per-module imports (for example
|
|
5
|
+
``from strsimpy.levenshtein import Levenshtein``) continue to work.
|
|
6
|
+
"""
|
|
7
|
+
|
|
8
|
+
from importlib.metadata import PackageNotFoundError, version as _package_version
|
|
9
|
+
|
|
10
|
+
from ._base import (
|
|
11
|
+
MetricStringDistance,
|
|
12
|
+
NormalizedStringDistance,
|
|
13
|
+
NormalizedStringSimilarity,
|
|
14
|
+
ShingleBased,
|
|
15
|
+
StringDistance,
|
|
16
|
+
StringSimilarity,
|
|
17
|
+
)
|
|
18
|
+
from ._strsimpy import (
|
|
19
|
+
SIFT4,
|
|
20
|
+
SIFT4Options,
|
|
21
|
+
Cosine,
|
|
22
|
+
Damerau,
|
|
23
|
+
Jaccard,
|
|
24
|
+
JaroWinkler,
|
|
25
|
+
Levenshtein,
|
|
26
|
+
LongestCommonSubsequence,
|
|
27
|
+
MetricLCS,
|
|
28
|
+
NGram,
|
|
29
|
+
NormalizedLevenshtein,
|
|
30
|
+
OptimalStringAlignment,
|
|
31
|
+
OverlapCoefficient,
|
|
32
|
+
QGram,
|
|
33
|
+
SorensenDice,
|
|
34
|
+
WeightedLevenshtein,
|
|
35
|
+
shingle_profile,
|
|
36
|
+
)
|
|
37
|
+
|
|
38
|
+
try:
|
|
39
|
+
__version__ = _package_version("strsimpy")
|
|
40
|
+
except PackageNotFoundError: # pragma: no cover - only when not installed
|
|
41
|
+
__version__ = "0.4.0"
|
|
42
|
+
|
|
43
|
+
__all__ = [
|
|
44
|
+
"SIFT4",
|
|
45
|
+
"Cosine",
|
|
46
|
+
"Damerau",
|
|
47
|
+
"Jaccard",
|
|
48
|
+
"JaroWinkler",
|
|
49
|
+
"Levenshtein",
|
|
50
|
+
"LongestCommonSubsequence",
|
|
51
|
+
"MetricLCS",
|
|
52
|
+
"MetricStringDistance",
|
|
53
|
+
"NGram",
|
|
54
|
+
"NormalizedLevenshtein",
|
|
55
|
+
"NormalizedStringDistance",
|
|
56
|
+
"NormalizedStringSimilarity",
|
|
57
|
+
"OptimalStringAlignment",
|
|
58
|
+
"OverlapCoefficient",
|
|
59
|
+
"QGram",
|
|
60
|
+
"SIFT4Options",
|
|
61
|
+
"ShingleBased",
|
|
62
|
+
"SorensenDice",
|
|
63
|
+
"StringDistance",
|
|
64
|
+
"StringSimilarity",
|
|
65
|
+
"WeightedLevenshtein",
|
|
66
|
+
"shingle_profile",
|
|
67
|
+
]
|
strsimpy/_base.py
ADDED
|
@@ -0,0 +1,126 @@
|
|
|
1
|
+
"""Abstract base classes kept for API compatibility.
|
|
2
|
+
|
|
3
|
+
The algorithms themselves live in the Rust extension module
|
|
4
|
+
``strsimpy._strsimpy``. The base classes are implemented in Python and the
|
|
5
|
+
native classes are registered as virtual subclasses, so ``isinstance`` checks
|
|
6
|
+
written against the original pure-Python API keep working.
|
|
7
|
+
"""
|
|
8
|
+
|
|
9
|
+
from abc import ABCMeta
|
|
10
|
+
|
|
11
|
+
from . import _strsimpy
|
|
12
|
+
from ._strsimpy import (
|
|
13
|
+
Cosine,
|
|
14
|
+
Damerau,
|
|
15
|
+
Jaccard,
|
|
16
|
+
JaroWinkler,
|
|
17
|
+
Levenshtein,
|
|
18
|
+
LongestCommonSubsequence,
|
|
19
|
+
MetricLCS,
|
|
20
|
+
NGram,
|
|
21
|
+
NormalizedLevenshtein,
|
|
22
|
+
OptimalStringAlignment,
|
|
23
|
+
OverlapCoefficient,
|
|
24
|
+
QGram,
|
|
25
|
+
SIFT4Options,
|
|
26
|
+
SorensenDice,
|
|
27
|
+
WeightedLevenshtein,
|
|
28
|
+
)
|
|
29
|
+
|
|
30
|
+
|
|
31
|
+
class StringDistance(metaclass=ABCMeta):
|
|
32
|
+
def distance(self, s0, s1):
|
|
33
|
+
raise NotImplementedError()
|
|
34
|
+
|
|
35
|
+
|
|
36
|
+
class NormalizedStringDistance(StringDistance):
|
|
37
|
+
def distance(self, s0, s1):
|
|
38
|
+
raise NotImplementedError()
|
|
39
|
+
|
|
40
|
+
|
|
41
|
+
class MetricStringDistance(StringDistance):
|
|
42
|
+
def distance(self, s0, s1):
|
|
43
|
+
raise NotImplementedError()
|
|
44
|
+
|
|
45
|
+
|
|
46
|
+
class StringSimilarity(metaclass=ABCMeta):
|
|
47
|
+
def similarity(self, s0, s1):
|
|
48
|
+
raise NotImplementedError()
|
|
49
|
+
|
|
50
|
+
|
|
51
|
+
class NormalizedStringSimilarity(StringSimilarity):
|
|
52
|
+
def similarity(self, s0, s1):
|
|
53
|
+
raise NotImplementedError()
|
|
54
|
+
|
|
55
|
+
|
|
56
|
+
class ShingleBased(metaclass=ABCMeta):
|
|
57
|
+
def __init__(self, k=3):
|
|
58
|
+
self.k = k
|
|
59
|
+
|
|
60
|
+
def get_k(self):
|
|
61
|
+
return self.k
|
|
62
|
+
|
|
63
|
+
def get_profile(self, string):
|
|
64
|
+
return _strsimpy.shingle_profile(string, self.k)
|
|
65
|
+
|
|
66
|
+
|
|
67
|
+
# Present the same module paths as the original pure-Python classes.
|
|
68
|
+
StringDistance.__module__ = "strsimpy.string_distance"
|
|
69
|
+
NormalizedStringDistance.__module__ = "strsimpy.string_distance"
|
|
70
|
+
MetricStringDistance.__module__ = "strsimpy.string_distance"
|
|
71
|
+
StringSimilarity.__module__ = "strsimpy.string_similarity"
|
|
72
|
+
NormalizedStringSimilarity.__module__ = "strsimpy.string_similarity"
|
|
73
|
+
ShingleBased.__module__ = "strsimpy.shingle_based"
|
|
74
|
+
|
|
75
|
+
|
|
76
|
+
# Keep isinstance() checks working exactly as they did with the class hierarchy
|
|
77
|
+
# of the pure-Python implementation.
|
|
78
|
+
StringDistance.register(OptimalStringAlignment)
|
|
79
|
+
StringDistance.register(WeightedLevenshtein)
|
|
80
|
+
StringDistance.register(QGram)
|
|
81
|
+
StringDistance.register(LongestCommonSubsequence)
|
|
82
|
+
StringDistance.register(SIFT4Options)
|
|
83
|
+
|
|
84
|
+
MetricStringDistance.register(Levenshtein)
|
|
85
|
+
MetricStringDistance.register(Damerau)
|
|
86
|
+
MetricStringDistance.register(Jaccard)
|
|
87
|
+
MetricStringDistance.register(MetricLCS)
|
|
88
|
+
MetricStringDistance.register(SIFT4Options)
|
|
89
|
+
|
|
90
|
+
NormalizedStringDistance.register(NormalizedLevenshtein)
|
|
91
|
+
NormalizedStringDistance.register(JaroWinkler)
|
|
92
|
+
NormalizedStringDistance.register(MetricLCS)
|
|
93
|
+
NormalizedStringDistance.register(NGram)
|
|
94
|
+
NormalizedStringDistance.register(Jaccard)
|
|
95
|
+
NormalizedStringDistance.register(Cosine)
|
|
96
|
+
NormalizedStringDistance.register(SorensenDice)
|
|
97
|
+
NormalizedStringDistance.register(OverlapCoefficient)
|
|
98
|
+
|
|
99
|
+
StringSimilarity.register(NormalizedLevenshtein)
|
|
100
|
+
StringSimilarity.register(JaroWinkler)
|
|
101
|
+
StringSimilarity.register(Jaccard)
|
|
102
|
+
StringSimilarity.register(Cosine)
|
|
103
|
+
StringSimilarity.register(SorensenDice)
|
|
104
|
+
StringSimilarity.register(OverlapCoefficient)
|
|
105
|
+
|
|
106
|
+
NormalizedStringSimilarity.register(NormalizedLevenshtein)
|
|
107
|
+
NormalizedStringSimilarity.register(JaroWinkler)
|
|
108
|
+
NormalizedStringSimilarity.register(Jaccard)
|
|
109
|
+
NormalizedStringSimilarity.register(Cosine)
|
|
110
|
+
NormalizedStringSimilarity.register(SorensenDice)
|
|
111
|
+
NormalizedStringSimilarity.register(OverlapCoefficient)
|
|
112
|
+
|
|
113
|
+
ShingleBased.register(QGram)
|
|
114
|
+
ShingleBased.register(Cosine)
|
|
115
|
+
ShingleBased.register(Jaccard)
|
|
116
|
+
ShingleBased.register(SorensenDice)
|
|
117
|
+
ShingleBased.register(OverlapCoefficient)
|
|
118
|
+
|
|
119
|
+
__all__ = [
|
|
120
|
+
"MetricStringDistance",
|
|
121
|
+
"NormalizedStringDistance",
|
|
122
|
+
"NormalizedStringSimilarity",
|
|
123
|
+
"ShingleBased",
|
|
124
|
+
"StringDistance",
|
|
125
|
+
"StringSimilarity",
|
|
126
|
+
]
|
strsimpy/_strsimpy.pyd
ADDED
|
Binary file
|
strsimpy/cosine.py
ADDED
strsimpy/damerau.py
ADDED
strsimpy/jaccard.py
ADDED
strsimpy/jaro_winkler.py
ADDED
strsimpy/levenshtein.py
ADDED
strsimpy/metric_lcs.py
ADDED
strsimpy/ngram.py
ADDED
strsimpy/qgram.py
ADDED
strsimpy/sift4.py
ADDED
|
@@ -0,0 +1,23 @@
|
|
|
1
|
+
"""Weighted Levenshtein distance."""
|
|
2
|
+
|
|
3
|
+
from ._strsimpy import WeightedLevenshtein
|
|
4
|
+
|
|
5
|
+
|
|
6
|
+
def default_insertion_cost(char):
|
|
7
|
+
return 1.0
|
|
8
|
+
|
|
9
|
+
|
|
10
|
+
def default_deletion_cost(char):
|
|
11
|
+
return 1.0
|
|
12
|
+
|
|
13
|
+
|
|
14
|
+
def default_substitution_cost(char_a, char_b):
|
|
15
|
+
return 1.0
|
|
16
|
+
|
|
17
|
+
|
|
18
|
+
__all__ = [
|
|
19
|
+
"WeightedLevenshtein",
|
|
20
|
+
"default_deletion_cost",
|
|
21
|
+
"default_insertion_cost",
|
|
22
|
+
"default_substitution_cost",
|
|
23
|
+
]
|