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.

Source Distribution

svectors-0.1.1.tar.gz (7.5 kB view details)

Uploaded Source

File details

Details for the file svectors-0.1.1.tar.gz.

File metadata

  • Download URL: svectors-0.1.1.tar.gz
  • Upload date:
  • Size: 7.5 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No

File hashes

Hashes for svectors-0.1.1.tar.gz
Algorithm Hash digest
SHA256 d464494c167115941a6231d23982c0346193f26878124f92016a39710d8a4a84
MD5 dcbbce3749cbea2ff4d3fb00d821d5fd
BLAKE2b-256 d77482e21402753e7b9094855ef8edd5ce06075208d53b65b1e1eee94b56eeeb

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page