You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
The text was updated successfully, but these errors were encountered:
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.
The text was updated successfully, but these errors were encountered: