MCPcopy Create free account
hub / github.com/clips/pattern / levenshtein_similarity

Function levenshtein_similarity

pattern/metrics.py:271–274  ·  view source on GitHub ↗

Returns the similarity of string1 and string2 as a number between 0.0 and 1.0.

(string1, string2)

Source from the content-addressed store, hash-verified

269edit_distance = levenshtein
270
271def levenshtein_similarity(string1, string2):
272 """ Returns the similarity of string1 and string2 as a number between 0.0 and 1.0.
273 """
274 return 1 - levenshtein(string1, string2) / float(max(len(string1), len(string2), 1.0))
275
276def dice_coefficient(string1, string2):
277 """ Returns the similarity between string1 and string1 as a number between 0.0 and 1.0,

Callers 1

similarityFunction · 0.85

Calls 2

levenshteinFunction · 0.85
lenFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…