[TEXT-139] Improve JaccardSimilarity computational cost

• Type: Improvement
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Assignee: Unassigned
• Reporter: nick wong
• Created: 10/Sep/18 13:32
• Updated: 28/Sep/18 16:48
• Resolved: 28/Sep/18 16:48

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.

 

Issue Links

• links to: GitHub Pull Request #88