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
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
jaccard_index-0.0.2.tar.gz
(1.8 kB
view hashes)
Built Distribution
Close
Hashes for jaccard_index-0.0.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 2bf7b9e9ee12285fa85b9c523d6bf796c7e6d8b38eabbebd2e8d8ebefb36e26f |
|
MD5 | 901ed4961439db81165f99794cd79290 |
|
BLAKE2b-256 | eb71b03477c26c6aca26e36bfc4792e6649d6a950dcab551dc1e8589ae21c0e5 |