A fuzzy match library exposed by rest endpoint written in GoLang
-
Updated
Oct 25, 2017 - Go
A fuzzy match library exposed by rest endpoint written in GoLang
Find the best match for a token word with dictionary via min edit distance and levenshtein
Implementation of the Levenshtein Algorithm in x86 Assembler (for multi-threaded use). [ENG]
C++/Assembler language program simulating the operation of autocorrect using the Levenshtein (Editing Distance) Algorithm. [PL]
This sample compare two text files similarity using memory efficient Levenshtein algorithm.
Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters
A Levenshtein Distance implementation using C++ with a dynamic programming approach.
[VUE] - Visual dynamic algorithm using levenshtein and KMP search algorithm.
Implementation of Levenshtein Algorithm
Fuzzy search using Levenshtein Distance (LD) and Longest Common Substring (LCS) algorithm.
Shortens the paragraph depending on the given keywords using Levenshtein distance
Bot Dialog Flow Telegram untuk memenuhi Tugas Akhir Matakuliah Multi Channel Access
🤖 ChatBot program, which is able to discuss some C++ related topics based on the content of a knowledge base.
This C++ and C# repository holds a variety of common pattern-matching algorithms
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.
VBA Functions/Subs for performing fuzzy matching in Excel Workbooks.
Here Is Program To Check The Spelling And Correction in Spelling mistake suggester
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.
Add a description, image, and links to the levenshtein-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-algorithm topic, visit your repo's landing page and select "manage topics."