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

Web-based text aligner and comparator

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

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

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

Implementation of Levenshtein Algorithm

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

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

Finding matching concepts in OCL MSF Source

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.

Implemented various spellcheck techniques like cosine similarity, jaccard similarity and levenshtein distance. Open to any further contributions.

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

This sample compare two text files similarity using memory efficient Levenshtein algorithm.