{"x402Version":2,"name":"String Similarity & Fuzzy Name Matching","description":"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.","version":"0.1.0","openapi":"https://similarity.openverbs.com/openapi.json","resources":[{"url":"https://similarity.openverbs.com/v1/levenshtein","method":"POST","description":"Levenshtein edit distance (insertions, deletions, substitutions) between two strings, plus a normalized similarity in [0,1]. Operates on Unicode code points.","tags":["levenshtein distance","edit distance api","string edit distance","compare two strings","fuzzy string match","normalized text similarity"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://similarity.openverbs.com/v1/damerau","method":"POST","description":"Damerau-Levenshtein distance — like Levenshtein but also counts adjacent transpositions as a single edit — plus a normalized similarity in [0,1].","tags":["damerau levenshtein distance","transposition edit distance","typo similarity api","adjacent swap distance","fuzzy typo matching","string edit distance with swaps"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://similarity.openverbs.com/v1/hamming","method":"POST","description":"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.","tags":["hamming distance","equal length string distance","character mismatch count","compare fixed length strings","binary string similarity","position difference metric"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://similarity.openverbs.com/v1/jaro","method":"POST","description":"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.","tags":["jaro winkler similarity","jaro similarity api","name similarity score","short string matching","prefix boosted matching","fuzzy name comparison"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://similarity.openverbs.com/v1/dice","method":"POST","description":"Sørensen-Dice similarity coefficient in [0,1] over character bigrams — robust to word order and minor edits.","tags":["sorensen dice coefficient","dice similarity api","character bigram similarity","bigram text comparison","word order tolerant match","string overlap score"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://similarity.openverbs.com/v1/jaccard","method":"POST","description":"Jaccard similarity index in [0,1] — the size of the intersection over the union of the two strings' character-bigram sets.","tags":["jaccard index","jaccard similarity api","set overlap similarity","character bigram jaccard","intersection over union text","compare string sets"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.004","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://similarity.openverbs.com/v1/soundex","method":"POST","description":"Encode a word with the classic Soundex algorithm (letter + 3 digits) for phonetic matching of names.","tags":["soundex api","soundex encode name","phonetic name code","classic name matching","surname sound matching","english phonetic lookup"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.002","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://similarity.openverbs.com/v1/metaphone","method":"POST","description":"Encode a word with the Metaphone algorithm — more accurate than Soundex for English pronunciation.","tags":["metaphone api","metaphone encode word","english pronunciation code","phonetic search key","better soundex matching","name pronunciation matching"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.002","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://similarity.openverbs.com/v1/double-metaphone","method":"POST","description":"Encode a word with Double Metaphone, returning a primary and a secondary code to capture alternate pronunciations (useful for non-English names).","tags":["double metaphone api","double metaphone encode","alternate pronunciation codes","non english name matching","primary secondary phonetic code","multilingual phonetic lookup"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.002","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]},{"url":"https://similarity.openverbs.com/v1/compare","method":"POST","description":"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.","tags":["phonetic compare api","sounds alike names","compare name pronunciation","fuzzy phonetic match","soundex metaphone compare","name dedup by sound"],"accepts":[{"scheme":"exact","network":"eip155:8453","price":"$0.002","payTo":"0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A","asset":"USDC"}]}]}