Searched refs:subcost (Results 1 – 1 of 1) sorted by relevance
537 int subcost, int addcost, int delcost) { in levenshtein() argument545 dp[0][j] = dp[1][j - 1] + (a[i - 1] == b[j - 1] ? 0 : subcost); in levenshtein()