Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...

Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm

Various utilities regarding Levenshtein transducers. (Java)

A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.

English word spelling correction program

Algorithms and Data Structures a comprehensive collection of fundamental Algorithms and Data structures organized into various categories to cater to the needs of software engineers and computer science students.

A BK tree for fast, fuzzy, in-memory string matching

Algorithm for the derivation of the top-K string alignments, based on the Levenshtein distance.

Projeto de LP II e EDB II com Árvore Trie de Prefixos

JavaFX application for detecting similarity between Python source code files using Levenshtein distance as a metric.

A parameterizable Damerau Levenshtein aligner in Java.

Levenshtein distance search enabled Vaadin CRUD

Homoglyph detection tool (backend)

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.

Implementation of Levenshtein Algorithm

МГТУ ИУ7 "Анализ алгоритмов" лабораторные работы

Edit Distance Problem

No chat until a block is run and check for spam via Levenshtein distance.

String similarity