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.

Shortens the paragraph depending on the given keywords using Levenshtein distance

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

Web-based text aligner and comparator

Implementation of Levenshtein Algorithm

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

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.

[VUE] - Visual dynamic algorithm using levenshtein and KMP search algorithm.

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

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

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

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]

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

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

Finding matching concepts in OCL MSF Source