similarity.openverbs.com publishes 7 machine-payable endpoints over the x402 protocol, priced from $0.002 to $0.004 per call. Each was probed directly; the response code below is what it returned.
| Endpoint | Method | Price | Probe |
|---|---|---|---|
| /v1/compare | GET | $0.002 | 402 |
| /v1/damerau | GET | $0.004 | 402 |
| /v1/double-metaphone | GET | $0.002 | 402 |
| /v1/hamming | GET | $0.004 | 402 |
| /v1/jaccard | GET | $0.004 | 402 |
| /v1/jaro | GET | $0.004 | 402 |
| /v1/levenshtein | GET | $0.004 | 402 |
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.
Damerau-Levenshtein distance — like Levenshtein but also counts adjacent transpositions as a single edit — plus a normalized similarity in [0,1].
Encode a word with Double Metaphone, returning a primary and a secondary code to capture alternate pronunciations (useful for non-English names).
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.
Jaccard similarity index in [0,1] — the size of the intersection over the union of the two strings' character-bigram sets.
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 lik…
Levenshtein edit distance (insertions, deletions, substitutions) between two strings, plus a normalized similarity in [0,1]. Operates on Unicode code points.