[OPENNLP-879] Use PriorityQueue instead of Heap in BeamSearch

• Type: Improvement
• Status: Closed
• Priority: Trivial
• Resolution: Fixed
• Fix Version/s: 1.7.0
• Component/s: Machine Learning
• Assignee: Jörn Kottmann
• Reporter: Jörn Kottmann
• Created: 02/Nov/16 22:11
• Updated: 07/Nov/16 18:53
• Resolved: 07/Nov/16 18:53

Description

It was pointed out in OPENNLP-830 that we can just use PriorityQueue in BeamSeach instead of the cutstom Heap implementation. This class is slightly faster of around 2- 3% with the Name Finder, not speed increase with the POSTagger.

In the end this will allow us to remove the custom Heap implementations and the Java version will be maintained for us.