Directory / similarity.openverbs.com
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.
# 1. Ask the endpoint what it costs (no payment, no wallet needed): curl -i -X GET 'https://similarity.openverbs.com/v1/hamming' # -> HTTP/1.1 402 Payment Required # the response carries the price, asset and pay-to address. # 2. Pay and retry with any x402 client: npx x402-fetch 'https://similarity.openverbs.com/v1/hamming'
Endpoint: https://similarity.openverbs.com/v1/hamming. Operated by similarity.openverbs.com, not by Animica. Price and availability were correct at the last probe on 2026-10-01 and are set by the operator, who may change them.
Report whether two tokens sound alike under a chosen algorithm (soundex, metaphone or double-metaphone; default double-metaphone). Returns each token's codes an…
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).
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…
Levenshtein edit distance (insertions, deletions, substitutions) between two strings, plus a normalized similarity in [0,1]. Operates on Unicode code points.