MAG for approximate pattern matching (MAGA)
-
Updated
Dec 22, 2018 - C++
MAG for approximate pattern matching (MAGA)
A C++11 port of Buffer, μ-framework for efficient array diffs, collection observation and data source implementation.
Port of fuzz-aldrin-plus. Sublime text like fuzzy filtering
Takes words from the user and checks if it is spelled correctly according to a wordlist containing the 10000 most used English words.
Calculation Of Levenshtein Distance
Python Deveopment
Algorithms and Data Structures course assignments: Degeneracy - Graph Theory, Broken Telephone, Plant Grammar and K-Minimum Spanning Tree - Bonus
Official implementation of "Weighted Weighted Edit Distance optimized using Genetic Algorithm for SMILES-based Compound Similarity, PAAA(SCIE)".
A simple JS game for dengue education
Global etymology approximation with Levenshtein distance
API for name similarity check
Performs OCR on a list of images using Tesseract and performs fuzzy string matching with a given list of strings.
Find pairs of similar files according to Levenshtein distance.
Jupyter Notebook illustrates and compares different approaches to sentence similarity scoring.
Plain PHP implementation of the Levenshtein distance
Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein
@College_Project: A tool for detecting and extracting relevant information from a call for papers (CFP).
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."