An Elixir package for calculating between-list edit distances
-
Updated
Jun 6, 2017 - Elixir
#
wagner-fischer-algorithm
Here are 14 public repositories matching this topic...
An Elm package for calculating between-list edit distances
-
Updated
Mar 3, 2019 - Elm
The repo is about implementation of Wagner-Fischer algorithm for calculating Levenshtein distance between two strings.
python edit-distance levenshtein-distance dynamic-programming wagner-fischer-algorithm minimum-edit-distance
-
Updated
Jun 8, 2021 - Python
A Python-based spell checker using the Wagner-Fischer distance algorithm 📝
-
Updated
Jan 23, 2024 - Python
AntiPlagiat for Tinkoff '23
ast python3 levenshtein-distance argparse regular-expressions onefile wagner-fischer-algorithm damerau-levenshtein-distance antiplagiat
-
Updated
Jan 7, 2023 - Python
Implemented the Wagner-Fischer algorithm in both Rust and Python, enhancing performance and cross-language compatibility for dynamic programming solutions.
-
Updated
May 25, 2024 - Rust
Implementation of the Wagner-Fischer algorithm
-
Updated
Mar 9, 2024 - JavaScript
Anti-plagiarism calculating the Levenshtein distance using the Wagner-Fischer algorithm
-
Updated
Jan 8, 2023 - Python
An interactive spell checker application using Python and Tkinter, featuring real-time error detection and correction suggestions powered by advanced algorithms.
-
Updated
Jul 26, 2024 - Python
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.
-
Updated
May 29, 2024 - JavaScript
spellSensei is a lightweight Python-based spell checker using the Wagner-Fischer algorithm to calculate Levenshtein distance and suggest accurate corrections. Designed for efficiency, it seamlessly integrates into applications without sacrificing performance. Ideal for enhancing text accuracy in personal projects or larger systems.
python algorithms data-structures dynamic-programming spell-checker wagner-fischer-algorithm scratch-implementation
-
Updated
Dec 31, 2024 - HTML
Implementation of BFS tasks & Edit Distance in Java
java linked-list edit-distance frame swing-gui wagner-fischer-algorithm bfs-algorithm bfs-search hashmap-java bfs-tree
-
Updated
Jun 28, 2020 - Java
Implementation of Wagner–Fischer algorithm for Levenshtein distance between two strings
-
Updated
Dec 15, 2020 - Python
Simple example of Wagner Fischer's algorithm written is Rust Lang.
autocomplete algorithm algorithms wagner autocorrect wagner-fischer-algorithm wagner-fischer autocorrection
-
Updated
Apr 18, 2024 - Rust
Improve this page
Add a description, image, and links to the wagner-fischer-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the wagner-fischer-algorithm topic, visit your repo's landing page and select "manage topics."