nick wong created TEXT-139:
------------------------------
Summary: Improve JaccardSimilarity computational cost
Key: TEXT-139
URL: https://issues.apache.org/jira/browse/TEXT-139
Project: Commons Text
Issue Type: Improvement
Reporter: nick wongImprove 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. -- This message was sent by Atlassian JIRA (v7.6.3#76005)
