[jira] [Reopened] (OPENNLP-879) Use PriorityQueue instead of Heap in BeamSearch

["Joern Kottmann (JIRA)" <ji...@apache.org>]

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

Joern Kottmann reopened OPENNLP-879:
------------------------------------

It should use the remove instead of poll method. The remove method has exactly the same behaviour as we had before. If the queue runs empty and it tries to remove an element from it an exception is thrown.

> Use PriorityQueue instead of Heap in BeamSearch
> -----------------------------------------------
>
>                 Key: OPENNLP-879
>                 URL: https://issues.apache.org/jira/browse/OPENNLP-879
>             Project: OpenNLP
>          Issue Type: Improvement
>          Components: Machine Learning
>            Reporter: Joern Kottmann
>            Assignee: Joern Kottmann
>            Priority: Trivial
>             Fix For: 1.6.1
>
>
> 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.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)