Jaccard index

active

String similarity and fuzzy matching. Edit-distance and set metrics — Levenshtein, Damerau-Levenshtein, Hamming, Jaro-Winkler, Sørensen-Dice, Jaccard — plus phonetic encoders (Soundex, Metaphone, Double Metaphone) and phonetic comparison. Everything an agent needs for dedup, record linkage and name matching. Deterministic.

Transactions · 30d
0
Volume · 30d
$0.00
Unique buyers · 30d
0
Uptime · 30d
100.0%
Latency p50
185ms
Reported calls · 30d
17

Endpoints (10 live)

  • POST /v1/dice — Sørensen-Dice similarity coefficient in [0,1] over character bigrams — robust to word order and minor edits. (0.004 USDC on Base)
  • POST /v1/double-metaphone — Encode a word with Double Metaphone, returning a primary and a secondary code to capture alternate pronunciations (useful for non-English names). (0.002 USDC on Base)
  • POST /v1/metaphone — Encode a word with the Metaphone algorithm — more accurate than Soundex for English pronunciation. (0.002 USDC on Base)
  • POST /v1/soundex — Encode a word with the classic Soundex algorithm (letter + 3 digits) for phonetic matching of names. (0.002 USDC on Base)
  • POST /v1/jaro — Jaro similarity and the Jaro-Winkler variant (which boosts scores for a shared prefix), both in [0,1]. The prefix boost factor is configurable (default 0.1, max 0.25). Well suited to short strings like names. (0.004 USDC on Base)
  • POST /v1/compare — Report whether two tokens sound alike under a chosen algorithm (soundex, metaphone or double-metaphone; default double-metaphone). Returns each token's codes and a boolean match. (0.002 USDC on Base)
  • POST /v1/jaccard — Jaccard similarity index in [0,1] — the size of the intersection over the union of the two strings' character-bigram sets. (0.004 USDC on Base)
  • POST /v1/levenshtein — Levenshtein edit distance (insertions, deletions, substitutions) between two strings, plus a normalized similarity in [0,1]. Operates on Unicode code points. (0.004 USDC on Base)
  • POST /v1/hamming — Hamming distance — the number of positions at which two EQUAL-LENGTH strings differ — plus a normalized similarity. Strings of unequal length are a clean 400. (0.004 USDC on Base)
  • POST /v1/damerau — Damerau-Levenshtein distance — like Levenshtein but also counts adjacent transpositions as a single edit — plus a normalized similarity in [0,1]. (0.004 USDC on Base)

First seen · last seen