{"enrichment":{"capability":"Levenshtein computes string edit distances, similarities, and related operations like approximate median strings using a fast C extension, with support for sequence and set comparisons.","verdict":"Levenshtein is a well-maintained, actively developed library (398 GitHub stars, recent release) with no known vulnerabilities and broad platform support via prebuilt wheels. Its GPL-2.0-or-later copyleft license requires careful review if you plan to redistribute or modify the code. Medium install friction is offset by availability of compiled binaries for all major platforms and Python versions."},"id":"levenshtein","links":{"html":"https://skillfed.io/packages/levenshtein","md":"https://skillfed.io/packages/levenshtein.md","pypi":"https://pypi.org/project/levenshtein/"},"maintenance":{"status":"active"},"meta":{"latest_release":"2026-08-08","license_spdx":"GPL-2.0-or-later","license_treatment":"copyleft","name":"Levenshtein","python_support":"supports_current","summary":"Python extension for computing string edit distances and similarities."},"popularity":{"tier":"top_1000"},"security":{"n_vulnerabilities":0},"version":"0.27.4"}