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
There exist analysis tasks where the similarity between pairs of strings needs to be computed. In this setting, computing a similarity matrix over all strings is clearly an overkill and it would be great if Harry could support this setting, e.g. using a special command-line option.
The text was updated successfully, but these errors were encountered:
That's a very good idea. However, we would need to introduce a new representation and output format. Currently, Harry stores computed similarity values in a matrix. The benefit of a threshold would be that many of the matrix entries could be omitted and we would end with a sparse representation. I'll put this on my TODO list.
There exist analysis tasks where the similarity between pairs of strings needs to be computed. In this setting, computing a similarity matrix over all strings is clearly an overkill and it would be great if Harry could support this setting, e.g. using a special command-line option.
The text was updated successfully, but these errors were encountered: