The repo is about implementation of Wagner-Fischer algorithm for calculating Levenshtein distance between two strings.
A Python-based spell checker using the Wagner-Fischer distance algorithm 📝
AntiPlagiat for Tinkoff '23
Implementation of Wagner–Fischer algorithm for Levenshtein distance between two strings
An interactive spell checker application using Python and Tkinter, featuring real-time error detection and correction suggestions powered by advanced algorithms.
Anti-plagiarism calculating the Levenshtein distance using the Wagner-Fischer algorithm
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."