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


Release history Release notifications

This version
History Node

0.1.1

History Node

0.1

Download files

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

Filename, size & hash SHA256 hash help File type Python version Upload date
svectors-0.1.1.tar.gz (7.5 kB) Copy SHA256 hash SHA256 Source None Sep 24, 2010

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging CloudAMQP CloudAMQP RabbitMQ AWS AWS Cloud computing Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page