🎓 👾 My master's thesis
-
Updated
Jun 22, 2021 - HTML
🎓 👾 My master's thesis
NormNumSuM (normalised Number of Substring Movements) is a string comparison algorithm designed to be token order invariant.
Identifies files with similar content among a list of files using genetic algorithm
Ruby Levenshtein Library Benchmark
Levenshtein distance of two text files
A key/value store with JSON serialization
Fast implementation of the Levenshtein edit distance
cli tool for finding similar word in a file
Fuzzy text match app that finds similar strings in CSV file and gets the matching percentage.
Investigating approaches for computing Edit Distance of 2 strings
Class library with some text matching & processing methods
A clean golang calculator for Leveshtein Distance (using the techniques of Clean Code).
Levenshtein algorithm with zero dependencies
C++/Assembler language program simulating the operation of autocorrect using the Levenshtein (Editing Distance) Algorithm. [PL]
Go calculate Levenshtein Distance.
Fuzzy search using Levenshtein Distance (LD) and Longest Common Substring (LCS) algorithm.
This sample compare two text files similarity using memory efficient Levenshtein algorithm.
Levenshtein distance calculator for word pairs
Add a description, image, and links to the levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein topic, visit your repo's landing page and select "manage topics."