Skip to content

Added Levenshtein Distance Algorithm #263

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
itsvinayak merged 1 commit into from
Aug 19, 2020
Merged

Added Levenshtein Distance Algorithm #263

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
49 changes: 49 additions & 0 deletions Dynamic-Programming/LevenshteinDistance.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
/**
* A Dynamic Programming based solution for calculation of the Levenshtein Distance
* https://en.wikipedia.org/wiki/Levenshtein_distance
*/

function minimum (a, b, c) {
if (a < b && a < c) {
return a
} else if (b < a && b < c) {
return b
} else {
return c
}
}

function costOfSubstitution (x, y) {
return x === y ? 0 : 1
}

function calculate (x, y) {
const dp = new Array(x.length + 1)
for (let i = 0; i < x.length + 1; i++) {
dp[i] = new Array(y.length + 1)
}

for (let i = 0; i < x.length + 1; i++) {
for (let j = 0; j < y.length + 1; j++) {
if (i === 0) {
dp[i][j] = j
} else if (j === 0) {
dp[i][j] = i
} else {
dp[i][j] = minimum(dp[i - 1][j - 1] + costOfSubstitution(x.charAt(i - 1), y.charAt(j - 1)), dp[i - 1][j] + 1, dp[i][j - 1] + 1)
}
}
}

return dp[x.length][y.length]
}

function main () {
const x = '' // enter your string here
const y = '' // enter your string here

console.log('Levenshtein distance between ' + x + ' and ' + y + ' is: ')
console.log(calculate(x, y))
}

main()