GitHub topics: wagner-fischer-algorithm
mayank-02/minimum-edit-distance
Implementation of Wagner–Fischer algorithm for Levenshtein distance between two strings
Language: Python - Size: 3.91 KB - Last synced at: about 1 month ago - Pushed at: over 4 years ago - Stars: 1 - Forks: 0
kanavgoyal898/spellSensei
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.
Language: HTML - Size: 136 KB - Last synced at: about 1 month ago - Pushed at: 3 months ago - Stars: 0 - Forks: 0
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.
Language: JavaScript - Size: 6.84 KB - Last synced at: 11 months ago - Pushed at: 11 months ago - Stars: 0 - Forks: 0
SUPERustam/plagiat_2023
AntiPlagiat for Tinkoff '23
Language: Python - Size: 1.59 MB - Last synced at: 12 months ago - Pushed at: over 2 years ago - Stars: 1 - Forks: 0
vaibhav-OP/wagner-fischer Fork of b001io/wagner-fischer
Simple example of Wagner Fischer's algorithm written is Rust Lang.
Language: Rust - Size: 43 KB - Last synced at: about 1 year ago - Pushed at: about 1 year ago - Stars: 0 - Forks: 0
ImPavloh/wagner-fischer-spellcheck Fork of b001io/wagner-fischer
A Python-based spell checker using the Wagner-Fischer distance algorithm đź“ť
Language: Python - Size: 43.9 KB - Last synced at: about 1 year ago - Pushed at: about 1 year ago - Stars: 1 - Forks: 0
AlexandrosPlessias/BFSandEditDistance
Implementation of BFS tasks & Edit Distance in Java
Language: Java - Size: 323 KB - Last synced at: over 1 year ago - Pushed at: almost 5 years ago - Stars: 0 - Forks: 0
erwald/elixir-changeset
An Elixir package for calculating between-list edit distances
Language: Elixir - Size: 32.2 KB - Last synced at: 8 days ago - Pushed at: almost 8 years ago - Stars: 5 - Forks: 1
athlohangade/minimum-edit-distance
The repo is about implementation of Wagner-Fischer algorithm for calculating Levenshtein distance between two strings.
Language: Python - Size: 150 KB - Last synced at: almost 2 years ago - Pushed at: almost 4 years ago - Stars: 2 - Forks: 0
erwald/elm-edit-distance
An Elm package for calculating between-list edit distances
Language: Elm - Size: 23.4 KB - Last synced at: 8 days ago - Pushed at: about 6 years ago - Stars: 3 - Forks: 1