Skip to main content

Efficient implementation of dot product and bounded Jiang-Conrath similarity

Project description

svectors is a free implementation of two forms of computing word similarity. Specifically, it computes the dot product on sparse vectors (for the cosine similarity measure) and a bounded variant of the Jiang-Conrath similarity measure on the WordNet taxonomy. If you don’t know what these are, you probably don’t need this software. In particular, svectors will not simply compute word similarity for you. It’s mainly a tool for researchers in computational linguistics, and you need to feed it with appropriate data.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for svectors, version 0.1.1
Filename, size File type Python version Upload date Hashes
Filename, size svectors-0.1.1.tar.gz (7.5 kB) File type Source Python version None Upload date Hashes View

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page