{"uid":"cap_EULWqUiAwFh7L_N2AZ-vJ","slug":"signaldesk-ai-levenshtein-distance-790cf834","name":"SignalDesk AI Levenshtein Distance","description":"Evidence-backed autonomous AI jobs and paid data tools. Queue/D1/cron run outside the chat; free quotas and bounded execution apply.","url":"https://x402-agent.kariguetoazul.workers.dev/api/text/levenshtein?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"a":{"type":"string","maxLength":256,"description":"First text."},"b":{"type":"string","maxLength":256,"description":"Second text."}}},"responseSchema":{"type":"json","example":{"distance":3}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.001","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.001/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_O_ZljSRqOoeVqVbGgS4hT","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.001","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 strings, returning the minimum number of single-character edits needed to transform one into the other.","exampleAgentPrompt":"What's the Levenshtein distance between 'kitten' and 'sitting'?","exampleUseCases":[{"title":"Fuzzy name matching for deduplication","prompt":"I have two customer names — 'Jonathan Smith' and 'Jonathon Smyth' — can you calculate their edit distance so I can decide if they're likely the same person?"},{"title":"Spell-check candidate scoring","prompt":"I want to rank spell-check suggestions for the misspelled word 'recieve' — can you calculate the Levenshtein distance between 'recieve' and 'receive' so I can score how close they are?"},{"title":"Password similarity validation","prompt":"Check the edit distance between the old password 'Hunter2024' and the new password 'Hunter2025' — I want to reject new passwords that are too close to the old one."}],"resultDescription":"Returns a JSON object with a single integer field 'distance' representing the minimum number of single-character insertions, deletions, or substitutions required to transform string a into string b.","failureModes":["Input strings exceeding 256 characters will be rejected","Missing 'a' or 'b' fields return a validation error","Payment failure or insufficient USDC balance returns HTTP 402","Server-side quota exhaustion may return rate-limit errors"],"whenToPreferThis":"Use this endpoint when you need a simple, fast, authoritative edit-distance integer for two short strings (up to 256 chars each) without building your own algorithm — ideal for fuzzy matching, deduplication, spell-check scoring, or input validation pipelines where a pay-per-call micro-cost is acceptable.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-13T00:42:18.067Z","isFirstParty":false,"canonicalSlug":"signaldesk-ai-levenshtein-distance-790cf834"}