Python compatibility wrapper for computing string edit distances and similarities using fast Levenshtein algorithms.
88
{
"context": "This criteria evaluates how well the engineer uses the Levenshtein package's seqratio() function to implement order-sensitive sequence similarity analysis for document revision comparison.",
"type": "weighted_checklist",
"checklist": [
{
"name": "Uses seqratio function",
"description": "The implementation uses Levenshtein.seqratio() to compute similarity between sequences of words",
"max_score": 40
},
{
"name": "Correct similarity computation",
"description": "The compute_similarity() function correctly passes the two document word lists to seqratio() and returns the similarity score",
"max_score": 25
},
{
"name": "Find most similar implementation",
"description": "The find_most_similar() function correctly uses seqratio() to compare the target with each candidate and returns the index of the candidate with the highest similarity score",
"max_score": 25
},
{
"name": "Preserves sequence order",
"description": "The implementation correctly uses seqratio() rather than setratio(), ensuring word order is preserved in similarity calculations",
"max_score": 10
}
]
}Install with Tessl CLI
npx tessl i tessl/pypi-python-levenshteindocs
evals
scenario-1
scenario-2
scenario-3
scenario-4
scenario-5
scenario-6
scenario-7
scenario-8
scenario-9
scenario-10