{"uid":"cap_EncprrWv7zMaVIRWlCqK5","slug":"kihustle-levenshtein-distance-api-3fa3cc1e","name":"KiHustle Levenshtein Distance API","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/agents/api/v1/levenshtein-distance","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_smcqpiuIh6e8DcgBpTSki","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 the Levenshtein (edit) distance between two input strings","exampleAgentPrompt":"What is the Levenshtein distance between 'kitten' and 'sitting'?","exampleUseCases":[{"title":"Spell-check candidate ranking","prompt":"I have a misspelled word 'recieve' and a candidate correction 'receive' — can you calculate the edit distance between them so I can rank correction candidates?"},{"title":"Duplicate record deduplication","prompt":"I have two customer name strings 'Jonathan Smith' and 'Jonathon Smyth' — can you compute the Levenshtein distance to help me decide if they're likely the same person?"},{"title":"Password similarity validation","prompt":"Can you check the edit distance between 'OldPass123' and 'OldPass124' to see if a user's new password is too similar to their old one?"}],"resultDescription":"Returns a JSON object containing the computed Levenshtein (edit) distance — the minimum number of single-character insertions, deletions, or substitutions required to transform text_a into text_b — along with a success status field.","failureModes":["Missing text_a or text_b fields returns an error","Non-string input types may cause processing failure","Very long strings may cause timeout or unexpected behavior","Empty string inputs may return distance equal to length of the other string"],"whenToPreferThis":"Choose this endpoint when you need a simple, pay-per-call Levenshtein distance computation without setting up a local library or compute environment. It is ideal for lightweight agents performing fuzzy matching, deduplication, or spell-check ranking where infrastructure overhead should be minimal.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T00:58:27.215Z","isFirstParty":false}