Python library for fast approximate string matching using Jaro and Jaro-Winkler similarity
-
Updated
Jan 8, 2024 - Python
#
jaro
Here are 3 public repositories matching this topic...
Python implementation of several sequence alignment algorithms such as Waterman-Smith-Beyer, Gotoh, and Needleman-Wunsch intended to calculate distance, show alignment, and display the underlying matrices.
python distance smith-waterman needleman-wunsch python3 similarity jaro-winkler levenshtein-distance alignment longest-common-subsequence sequence-alignment hamming-distance jaro longest-common-substring shortest-common-supersequence gotoh hirschberg gotoh-algorithm ratcliff-obershelp waterman-smith-beyer
-
Updated
Oct 7, 2025 - Python
Just some implementations of word distance functions.
-
Updated
Oct 26, 2021 - Python
Improve this page
Add a description, image, and links to the jaro topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the jaro topic, visit your repo's landing page and select "manage topics."