Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Effective similarity matrix computation #47

Open
iokuznetsov opened this issue Oct 13, 2015 · 0 comments
Open

Effective similarity matrix computation #47

iokuznetsov opened this issue Oct 13, 2015 · 0 comments

Comments

@iokuznetsov
Copy link

It would be nice to have a method that given two lists of terms N and M returns an N*M similarity matrix for those terms. First, this representation seems to be generic and has many use cases. Second, batch similarity computation can be optimized to achieve better-than-naive performance and minimize reads. In the case of VSMs it can be even implemented as a matrix operation instead of pairwise vector similarities. The mtj library used in dkpro-similarity is powered by BLAS, so it should be possible to perform basic linear algebra operations really fast.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant