String Similarity Batch MCP Connector for Claude
A+High-performance string similarity computations for batch processing of large text arrays using algorithms like Levenshtein and Jaro-Winkler.
This MCP server provides precise, matrix-based string comparison metrics that are computationally expensive for LLMs. Use batch_rank_candidates to rank an array of strings against a target using metrics like levenshtein, jaro_winkler, or sorensen_dice. Alternatively, use compute_single_metric for one-to-one comparisons between two specific strings. It handles strings up to 5000 characters and supports algorithms including Damerau-Levenshtein and Longest Common Subsequence (LCS).
Related Connectors
Vector Similarity Threshold Enforcer MCP
Compute exact vector similarity scores and enforce strict relevance thresholds for RAG pipelines.
Embedding Dimension Optimizer MCP
A deterministic tool to balance embedding quality, latency, and storage efficiency.
Phylogenetic Tree Construction MCP
Construct evolutionary trees and calculate genetic distances from sequence alignments.
Repetition Pattern Detector MCP
Detects redundant linguistic patterns and calculates text compression metrics.