Algorithms and Data Structures
-
Updated
Apr 28, 2024 - Java
Algorithms and Data Structures
The Java Spell Checker is an application designed to assist users in detecting and rectifying misspelled words within a specified text file.
Levenshtein distance search enabled Vaadin CRUD
Turkish language spell checker GUI application
Algoritmos de programación dinámica
Here Is Program To Check The Spelling And Correction in Spelling mistake suggester
A parameterizable Damerau Levenshtein aligner in Java.
Homoglyph detection tool (backend)
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Various utilities regarding Levenshtein transducers. (Java)
API to get a word similarity in a given text using the Levenshtein algorithm.
JavaFX application for detecting similarity between Python source code files using Levenshtein distance as a metric.
A simple web service that returns word similarity by using Levenshtein Distance.
A simple autocorrect tool that can be used on Windows systems.
A string metric that measures proximity between 2 words. The metric calculation is a formula that utilizes 3 existing String metric algorithms: Jaccard Distance, Edit Distance and Longest Common Substring Distance.
Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
Implementation serial of Levenshtein distance algorithm.
Implement Levenshtein distance edit algorithm. You need to print the path for each step.
Update and Archive every Version of an online File!
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."