Less-wrong single-file Numba-accelerated Python implementation of Gotoh affine gap penalty extensions for the Needleman–Wunsch, Smith-Waterman, and Levenshtein algorithms for sequence alignment

VBA Functions/Subs for performing fuzzy matching in Excel Workbooks.

A Levenshtein Distance implementation using C++ with a dynamic programming approach.

Efficient typo-tolerant search in 76 lines of code, with no dependencies.

Calculates similarity between two Korean strings using Levenshtein distance with decomposed phonemes, improving accuracy.

Shortens the paragraph depending on the given keywords using Levenshtein distance

🌐Progetto "Parole", sviluppato in GoLang per l'esame di laboratorio del corso di "Algoritmi e strutture dati". Appello di Luglio 2025

Web-based text aligner and comparator

Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters

Bot Dialog Flow Telegram untuk memenuhi Tugas Akhir Matakuliah Multi Channel Access

Implementation of Levenshtein Algorithm

Implementation of the Levenshtein Algorithm in x86 Assembler (for multi-threaded use). [ENG]

A fuzzy match library exposed by rest endpoint written in GoLang

Python scripts used to calculate 3 basic similarity measures, suitable for ad hoc information retrieval systems: Levenshtein Edit Distance, Jaccard, and a Term-Document matrix.

Fuzzy search using Levenshtein Distance (LD) and Longest Common Substring (LCS) algorithm.

Finding matching concepts in OCL MSF Source

Find the best match for a token word with dictionary via min edit distance and levenshtein

This C++ and C# repository holds a variety of common pattern-matching algorithms

C++/Assembler language program simulating the operation of autocorrect using the Levenshtein (Editing Distance) Algorithm. [PL]

Here Is Program To Check The Spelling And Correction in Spelling mistake suggester