wagner-fischer-algorithm
There are 13 repositories under wagner-fischer-algorithm topic.
erwald/elixir-changeset
An Elixir package for calculating between-list edit distances
erwald/elm-edit-distance
An Elm package for calculating between-list edit distances
athlohangade/minimum-edit-distance
The repo is about implementation of Wagner-Fischer algorithm for calculating Levenshtein distance between two strings.
ImPavloh/wagner-fischer-spellcheck
A Python-based spell checker using the Wagner-Fischer distance algorithm đź“ť
ayushshankaram/Wagner-Fischer-Distance
Implemented the Wagner-Fischer algorithm in both Rust and Python, enhancing performance and cross-language compatibility for dynamic programming solutions.
SUPERustam/plagiat_2023
AntiPlagiat for Tinkoff '23
Aniruddh-482/spell_checker
An interactive spell checker application using Python and Tkinter, featuring real-time error detection and correction suggestions powered by advanced algorithms.
MariuszAndziak/Wagner-Fischer-algorithm
Implementation of the Wagner-Fischer algorithm
mayank-02/minimum-edit-distance
Implementation of Wagner–Fischer algorithm for Levenshtein distance between two strings
AlexandrosPlessias/BFSandEditDistance
Implementation of BFS tasks & Edit Distance in Java
AlikKostandov/antiplagiat
Anti-plagiarism calculating the Levenshtein distance using the Wagner-Fischer algorithm
sshahzaiib/wagner_fischer
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.
vaibhav-OP/wagner-fischer
Simple example of Wagner Fischer's algorithm written is Rust Lang.