Find the Jaro Winkler Distance which indicates the similarity score between two Strings
Project description
Find the Jaro Winkler Distance which indicates the similarity score between two Strings. The Jaro measure is the weighted sum of percentage of matched characters from each file and transposed characters. Winkler increased this measure for matching initial characters.
The Implementation
The original implementation is based on the Jaro Winkler Similarity Algorithm article that can be found on Wikipedia. This Python version of the original implementation is based on the Apache StringUtils library.
Correctness
Unittest similar to what you will find in the StringUtils library were used to validate implementation.
Note
A limit of shorter / 2 + 1 is used in StringUtils, this differs from Wikipedia and also Winkler’s paper, where a distance of longer / 2 - 1 is used, corresponding to positions of longer / 2. As of version 1.8, the algorithm now correctly works with the "CTRATE" - "TRACE" example from Wikipedia.
Example
>>> from pyjarowinkler import distance >>> # Scaling is 0.1 by default >>> print distance.get_jaro_distance("hello", "haloa", winkler=True, scaling=0.1) 0.76 >>> print distance.get_jaro_distance("hello", "haloa", winkler=False, scaling=0.1) 0.733333333333
- Version:
1.8 of 2016-03-22
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for pyjarowinkler-1.8-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | dc80f4e606a6384729a577d0a0dff5aceadb9efbe19bd0fc04e79d55ffd1e0aa |
|
MD5 | fc9a5bd0344c24c10cf57e7dce6e0370 |
|
BLAKE2b-256 | b958b89073047b447e02b08d4f64fbb984e5a4dfef4134477350b256c625c779 |