A way to analyse how malware and/or goodware samples vary from each other using Shannon Entropy, Hausdorff Distance and Jaro-Winkler Distance
-
Updated
Jan 22, 2022 - Python
A way to analyse how malware and/or goodware samples vary from each other using Shannon Entropy, Hausdorff Distance and Jaro-Winkler Distance
Comparison among four spelling correction methods. n-gram, Levenshtein, Jaro, Jaro_winkler
The main purpose of this project was to develop a matching algorithm in python to fuzzy classify people from a customer list as positive or negative based on a messy positive and negative database with a confidence score.
Cython extension modules for Levenshtein-distance, Jaro-Winkler-distance, Damerau-Levenshtein-distance, Hamming-distance
Matching records by linking entities using string and data matching
Detect lexical blending using similarity by approximate string matching and word vectors
Phishing detection using similarity (proximity) algorithms and typosquatting library
Add a description, image, and links to the jaro-winkler-distance topic page so that developers can more easily learn about it.
To associate your repository with the jaro-winkler-distance topic, visit your repo's landing page and select "manage topics."