GoalScope — edit_distance (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def edit_distance(s1, s2):↵
"""Compute the Levenshtein distance between two strings."""↵
m, n = len(s1), len(s2)↵
dp = [[0] * (n + 1) for _ in range(m + 1)]↵
↵
for i in range(m + 1):↵
dp[i][0] = i↵
for j in range(n + 1):↵
dp[0][j] = j↵
↵
for i in range(1, m + 1):↵
for j in range(1, n + 1):↵
if s1[i - 1] == s2[j - 1]:↵
cost = 0↵
else:↵
cost = 1↵
dp[i][j] = min(dp[i - 1][j] + 1, Deletion↵
dp[i][j - 1] + 1, Insertion↵
dp[i - 1][j - 1] + cost) Substitution↵
↵
return dp[m][n]↵
</code>