You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@commons.apache.org by "Rob Tompkins (JIRA)" <ji...@apache.org> on 2018/09/28 16:49:00 UTC

[jira] [Resolved] (TEXT-139) Improve JaccardSimilarity computational cost

     [ https://issues.apache.org/jira/browse/TEXT-139?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Rob Tompkins resolved TEXT-139.
-------------------------------
    Resolution: Fixed

Thanks [~nickwong]

> 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)