tdebatty/java-string-similarity

Health v2 · maintenance only

Flags: no_license

Adoption not part of the score

2738 stars · 416 forks observed · 2026-08-28

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

A Java library implementing a dozen string similarity and distance algorithms, including Levenshtein, Damerau-Levenshtein, Jaro-Winkler, Longest Common Subsequence, n-gram, Q-Gram, Jaccard index, Sorensen-Dice, and cosine similarity. It is available on Maven Central and requires Java 8 or later.

Use cases

• compare two strings for similarity in java
• compute levenshtein edit distance
• fuzzy match user input against a list of names
• deduplicate records with similar text fields
• calculate jaccard or cosine similarity between shingles
• measure string distance for spell correction

When to choose

• you need a well-tested Java library with many string distance algorithms behind one dependency
• you want normalized and metric variants of edit distance measures
• you need n-gram or shingle-based similarity like Jaccard, Sorensen-Dice, or cosine

When to avoid

• you work outside the JVM and need a native library for your language
• you need high-performance similarity search over large corpora rather than pairwise string comparison
• you need actively developed features, since the project is in maintenance

Facets

library · maturity maintenance

nlp search-engine developer-tools developer-tools jvm string-similarity levenshtein jaro-winkler edit-distance jaccard-index cosine-similarity n-gram fuzzy-matching natural-language-processing algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="tdebatty/java-string-similarity")