luozhouyang/python-string-similarity

Health v2 · maintenance only

Adoption not part of the score

1016 stars · 125 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

A Python 3 library implementing a dozen string similarity and distance algorithms, including Levenshtein variants, Jaro-Winkler, longest common subsequence, and n-gram-based measures like cosine, Jaccard, and Sorensen-Dice. It is a Python port of tdebatty/java-string-similarity, published on PyPI as strsimpy.

Use cases

• compare similarity between two strings in python
• compute levenshtein edit distance
• fuzzy match user input against a list of names
• calculate jaccard or cosine similarity of text n-grams
• deduplicate near-identical strings
• measure string distance for record linkage

When to choose

• you need pure-Python access to many string similarity algorithms in one package
• you want a drop-in Python port of java-string-similarity
• you need normalized and metric distance variants with documented computational costs

When to avoid

• you need maximum performance for large-scale fuzzy matching (C/C++ extensions like rapidfuzz are faster)
• you need actively developed features or recent bug fixes
• you only need one simple algorithm and prefer a minimal dependency

Facets

library · maturity maintenance

nlp parser search-engine developer-tools python cross-platform string-similarity edit-distance levenshtein jaro-winkler cosine-similarity n-gram fuzzy-matching natural-language-processing algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="luozhouyang/python-string-similarity")