{"uid":"cap_qSFlBM82Dka1ovdglQSvG","slug":"jaccard-similarity-calculator-bigram-word-86882d90","name":"Jaccard Similarity Calculator (Bigram/Word)","description":"Compute the Jaccard similarity coefficient between two strings using character bigrams or word tokens. Returns the ratio of intersection to union (0 = no overlap, 1 = identical sets). Deterministic, pure CPU.","url":"https://agent402.tools/api/jaccard-similarity","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"a":{"type":"string","description":"First string"},"b":{"type":"string","description":"Second string"},"mode":{"enum":["bigram","word"],"type":"string","description":"Tokenization mode: \"bigram\" (character bigrams) or \"word\" (whitespace-delimited tokens). Default: \"word\"."}}},"responseSchema":{"type":"json","example":{"mode":"bigram","union":7,"similarity":0.142857,"intersection":1}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.001","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.001/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_EasUdes5Z0eCGoZp8im9C","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.001","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes the Jaccard similarity coefficient between two strings using character bigrams or word tokens, returning a score from 0 (no overlap) to 1 (identical sets).","exampleAgentPrompt":"What's the Jaccard similarity between 'machine learning algorithms' and 'deep learning algorithms' using word tokens?","exampleUseCases":null,"resultDescription":"A numeric Jaccard similarity coefficient between 0.0 and 1.0, where 0 means no shared tokens/bigrams and 1 means the two strings are identical in their token/bigram sets.","failureModes":["Missing required fields 'a' or 'b' — returns error","Invalid 'mode' value not in ['bigram','word'] — returns validation error","Empty strings may yield a score of 0 or undefined behavior","Payment failure via x402 protocol if USDC balance is insufficient"],"whenToPreferThis":"Use this endpoint when you need a fast, deterministic, interpretable set-overlap similarity metric between two strings, especially when you want to choose between character-level (bigram) and word-level tokenization. Prefer over cosine/embedding similarity when you need a reproducible CPU-only computation with no ML model dependency and a clear mathematical definition.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T19:14:03.984Z","isFirstParty":false}