hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 07:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update levenshteinDistance.js

Browse Source
This commit is contained in:
Ryan Cwynar 2020-01-23 22:21:31 -05:00 committed by GitHub
parent ba2d8dc4a8
commit 5f2e46421f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 17 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
src/algorithms/string/levenshtein-distance/levenshteinDistance.js
View File

@ -35,3 +35,20 @@ export default function levenshteinDistance(a, b) {
return distanceMatrix[b.length][a.length];
}
export function levenshteinDistanceRec(P, T, i, j) {
// if called without initial distances, start with the length of the strings
if (i === undefined || j === undefined) return levenshteinDistanceRec(P, T, P.length - 1, T.length - 1);
// establish base cases
if (i === 0 && j === 0) return 0;
if (i === 0) return j;
if (j === 0) return i;
var sub = levenshteinDistanceRec(P, T, i-1, j-1) + (P[i]===T[j] ? 0 : 1); // substitution
var del = levenshteinDistanceRec(P, T, i, j-1) + 1; // insertion
var add = levenshteinDistanceRec(P, T, i-1, j) + 1; // deletion
// pick the transformation that minimizes the distance
return Math.min(sub, add, del);
};