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 Jaro similarity function to solve the name matching problem. The evaluation focuses specifically on correct usage of the jaro() function and appropriate application of its output for comparing and filtering names.",
"type": "weighted_checklist",
"checklist": [
{
"name": "Uses jaro function",
"description": "The implementation imports and uses Levenshtein.jaro() function to calculate similarity between strings",
"max_score": 40
},
{
"name": "Case-insensitive comparison",
"description": "The implementation correctly handles case-insensitive name comparison by converting strings to lowercase before passing to jaro()",
"max_score": 15
},
{
"name": "Threshold filtering",
"description": "The find_matches function correctly filters candidates by comparing jaro() output against the threshold parameter using >= comparison",
"max_score": 20
},
{
"name": "Maximum similarity selection",
"description": "The find_best_match function correctly identifies the candidate with the highest jaro() similarity score",
"max_score": 15
},
{
"name": "Return value correctness",
"description": "Functions return the correct types and values: calculate_similarity returns float, find_matches returns list in original order, find_best_match returns single string",
"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