levenshtein-algorithm

Exact biosequence alignment and folding on GPUs — Needleman-Wunsch, Smith-Waterman, Levenshtein, Zuker, and Sankoff with Gotoh adjustments and traceback

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

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

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

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

Fast pattern search library for Delphi with exact, masked, fuzzy and multi-pattern matching, stream support and AVX2 acceleration.

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

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

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

Finding matching concepts in OCL MSF Source

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.

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

A fuzzy match library exposed by rest endpoint written in GoLang

Fuzzy string matching that just works: answer checking for quizzes, search-as-you-type, did-you-mean, fuzzy find and highlight, dedupe. Fast, typed, zero dependencies.

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