You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@commons.apache.org by "nick wong (JIRA)" <ji...@apache.org> on 2018/09/10 13:34:00 UTC
[jira] [Updated] (TEXT-139) Improve JaccardSimilarity computational
cost
[ https://issues.apache.org/jira/browse/TEXT-139?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
nick wong updated TEXT-139:
---------------------------
Description:
Improve JaccardSimilarity computational cost from O(n*m) to O(n+m).
I found two unnecessary loops in JaccardSimilarity.calculateJaccardSimilarity() which can easy to be Improve.
I would make a PR soon.
was:
Improve JaccardSimilarity computational cost from O(n*m) to O(n+m).
I found two unnecessary loops in JaccardSimilarity.calculateJaccardSimilarity() which can easy to be Improve.
> Improve JaccardSimilarity computational cost
> --------------------------------------------
>
> Key: TEXT-139
> URL: https://issues.apache.org/jira/browse/TEXT-139
> Project: Commons Text
> Issue Type: Improvement
> Reporter: nick wong
> Priority: Major
> Original Estimate: 24h
> Remaining Estimate: 24h
>
> Improve JaccardSimilarity computational cost from O(n*m) to O(n+m).
> I found two unnecessary loops in JaccardSimilarity.calculateJaccardSimilarity() which can easy to be Improve.
> I would make a PR soon.
>
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)