Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
-
Updated
Jun 1, 2022 - Java
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
Various utilities regarding Levenshtein transducers. (Java)
Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
English word spelling correction program
JavaFX application for detecting similarity between Python source code files using Levenshtein distance as a metric.
A BK tree for fast, fuzzy, in-memory string matching
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.
Update and Archive every Version of an online File!
Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters
Takes words from the user and checks if it is spelled correctly according to a wordlist containing the 10000 most used English words.
МГТУ ИУ7 "Анализ алгоритмов" лабораторные работы
Dynamic Programming code for MO640 course
A simple autocorrect tool that can be used on Windows systems.
Here Is Program To Check The Spelling And Correction in Spelling mistake suggester
This package allow use strings operations to generic sequence
Turkish language spell checker GUI application
Java implementation of global alignment using a variation of Levenshteindistance. It takes first two sequences from fasta file and returns aligned sequences also in fasta format.
The Java Spell Checker is an application designed to assist users in detecting and rectifying misspelled words within a specified text 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."