You're viewing a demo portfolio

Join the waitlist
PRSM

levenshtein_distance

Active

Tool of IA-QA — 130+ QA & Dev Tools for AI Agents

declared in 1.0.0

Compute the Levenshtein (edit) distance and normalized similarity ratio between two strings. Supports batch comparison. Useful for fuzzy string matching, deduplication, and test result comparison.

Parameters schema

{
  "type": "object",
  "properties": {
    "a": {
      "type": "string",
      "description": "First string (single-pair mode)"
    },
    "b": {
      "type": "string",
      "description": "Second string (single-pair mode)"
    },
    "batch": {
      "type": "array",
      "items": {
        "type": "object",
        "properties": {
          "a": {
            "type": "string"
          },
          "b": {
            "type": "string"
          }
        }
      },
      "description": "Batch of {a,b} pairs (max 50)"
    },
    "case_insensitive": {
      "type": "boolean",
      "description": "Ignore case differences (default: false)"
    }
  }
}

What this tool wraps· 0 endpoints

min confidence0.700.50

No endpoints wrapped at confidence ≥ 0.70.

Parent server

IA-QA — 130+ QA & Dev Tools for AI Agents

https://github.com/jcjamet/ia-qa

1/7 registries
View full server →