Implementation of the Wagner-Fischer algorithm
-
Updated
Mar 9, 2024 - JavaScript
Implementation of the Wagner-Fischer algorithm
Implementation of the Wagner-Fischer algorithm in JavaScript for computing the Levenshtein distance between two strings, useful in applications like spell checking, DNA sequence alignment, and natural language processing.
Add a description, image, and links to the wagner-fischer-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the wagner-fischer-algorithm topic, visit your repo's landing page and select "manage topics."