Anti-plagiarism calculating the Levenshtein distance using the Wagner-Fischer algorithm
-
Updated
Jan 8, 2023 - Python
Anti-plagiarism calculating the Levenshtein distance using the Wagner-Fischer algorithm
An interactive spell checker application using Python and Tkinter, featuring real-time error detection and correction suggestions powered by advanced algorithms.
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.
Implementation of BFS tasks & Edit Distance in Java
Implementation of Wagner–Fischer algorithm for Levenshtein distance between two strings
Implementation of the Wagner-Fischer algorithm
Simple example of Wagner Fischer's algorithm written is Rust Lang.
AntiPlagiat for Tinkoff '23
Implemented the Wagner-Fischer algorithm in both Rust and Python, enhancing performance and cross-language compatibility for dynamic programming solutions.
A Python-based spell checker using the Wagner-Fischer distance algorithm 📝
The repo is about implementation of Wagner-Fischer algorithm for calculating Levenshtein distance between two strings.
An Elm package for calculating between-list edit distances
An Elixir package for calculating between-list edit distances
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."