{"uid":"cap_VXyDzGfbrbYluOR0mIvDt","slug":"kihustle-damerau-levenshtein-scorer-4a110c0a","name":"KiHustle Damerau-Levenshtein Scorer","description":"Kostenlose Guides, Solo-Playbooks und Artikel zu KI, Automation und Side Hustles — für Menschen, die mit echten Systemen online Einkommen aufbauen wollen. Transparent finanziert über faire Affiliate-Links.","url":"https://kihustle.tech/bot-bazaar/api/v1/damerau-levenshtein-scorer?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"text_a":{"type":"string"},"text_b":{"type":"string"}}},"responseSchema":{"type":"json","example":{"result":"processed","status":"success"}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.002","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.002/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_yHaNmAIq9B3HSj4MLG_FF","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.002","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes a Damerau-Levenshtein edit-distance similarity score between two input strings","exampleAgentPrompt":"What's the Damerau-Levenshtein similarity score between 'recieve' and 'receive'? I want to know how close these two spellings are.","exampleUseCases":[{"title":"Spell-check candidate ranking","prompt":"I have a misspelled word 'teh' and want to rank these candidate corrections — 'the', 'ten', 'tea' — by how similar they are to the original. Can you score each pair using Damerau-Levenshtein distance?"},{"title":"Duplicate record detection","prompt":"I have two customer names from different databases: 'Jonathan Smith' and 'Jonathon Smyth'. Can you give me a Damerau-Levenshtein score between them so I can decide if they're the same person?"},{"title":"Fuzzy search relevance scoring","prompt":"A user searched for 'javascrpit' — can you score how similar that is to 'javascript' using Damerau-Levenshtein so I can decide whether to auto-correct the query?"}],"resultDescription":"Returns a JSON object containing a computed similarity or distance result between the two input strings (text_a and text_b), along with a status field indicating success or failure of the computation.","failureModes":["Missing text_a or text_b fields returns an error","Empty string inputs may return a zero-distance or edge-case result","Very long strings may increase latency or hit limits","Malformed JSON body results in a 400-level error","Payment failure via x402 protocol blocks the request"],"whenToPreferThis":"Choose this endpoint when you need a transposition-aware edit-distance metric (Damerau-Levenshtein, not plain Levenshtein) for tasks like spell correction, fuzzy deduplication, or near-match ranking. Prefer it over plain Levenshtein when adjacent character transpositions (e.g. 'teh' vs 'the') should count as a single edit. It is a low-cost, low-latency per-call scorer suitable for real-time pipelines.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-22T07:23:01.622Z","isFirstParty":false,"canonicalSlug":"kihustle-damerau-levenshtein-scorer-4a110c0a"}