Jaccard Index for Two Strings
Project description
jaccard_index
Jaccard Index Computation
This package provides computation Jaccard Index based on n-grams for strings. This can be used as a metric for computing similarity between two strings e.g. Indentity resolution
Installation
Install using pip:
# pip install jaccard-index
To install using the archive, unpack it and run:
# python setup.py install
Usage
A common use case is to compare strings for similarity:
>>> from jaccard_index.jaccard import jaccard_index
>>> jaccard_index("abc","")
0
>>> jaccard_index("accessary", "accessory")
0.6
>>> jaccard_index("coffee", "coffee")
1
Release history Release notifications
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
| Filename, size | File type | Python version | Upload date | Hashes |
|---|---|---|---|---|
| Filename, size jaccard_index-0.0.3-py3-none-any.whl (2.3 kB) | File type Wheel | Python version py3 | Upload date | Hashes View hashes |
| Filename, size jaccard_index-0.0.3.tar.gz (1.8 kB) | File type Source | Python version None | Upload date | Hashes View hashes |
Close
Hashes for jaccard_index-0.0.3-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | ff37a8921006b6a5ba33f738ff00890ae30bfe8545a8b68d23c6ea16e7fb1dc8 |
|
| MD5 | 26bdeca41916b23236ee98508db4086e |
|
| BLAKE2-256 | e766a066229192ef1323b5a36bfc68a7d2e850227f96c0754349072369470255 |
