# tdebatty/java-string-similarity

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...

Repository: https://github.com/tdebatty/java-string-similarity
Canonical: https://ross.abutalabs.com/products/java-string-similarity
Language: Java
License: NOASSERTION
License Family: other
Topics: java, levenshtein-distance, cosine-similarity, string-distance, damerau-levenshtein, distance, distance-measure, jaro-winkler, similarity-measures, shingles, algorithm
Last push: 2022-06-01T19:43:43+00:00

## Health v2 (maintenance only)
Score: 23/100 (v2, computed 2026-09-03T02:20:16.233290+00:00)
- activity 0, release rhythm 8, longevity 100
- inputs: {"age_days": 4521, "days_push": 1554, "days_rel": null, "gap_med": null, "n_releases_24m": 0}
- flags: no_license
- formula: round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10)

## Adoption (not part of the score)
Stars 2738, forks 416 (observed 2026-08-28T04:07:16.361151+00:00)

## What it is
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
- artifact type: library
- maturity: maintenance
- function: nlp, search-engine, developer-tools
- domain: developer-tools
- platform: jvm
- tags: string-similarity, levenshtein, jaro-winkler, edit-distance, jaccard-index, cosine-similarity, n-gram, fuzzy-matching, natural-language-processing, algorithms

## Member repositories
- tdebatty/java-string-similarity (main) score 23

## Provenance
- Observed fields: from GitHub, fetched 2026-08-28T04:07:16.361151+00:00.
- Health v2: computed from the inputs above; adoption is never an input.
- Inferred fields (summary, facets, guidance): AI-extracted, prompt v1, taxonomy v1, on 2026-08-30T08:19:13.821565+00:00, confidence not recorded.
  - readme: https://github.com/tdebatty/java-string-similarity (fetched 2026-08-28T04:07:16.361151+00:00, sha f37d53084c7a)
- Data as of 2026-08-30T08:39:29.467469+00:00.