the cost function that the parser should use to evaluate the transitions
the parser will retain walks for suboptimal transitions whose costs are no worse than qualifyingCostDelta more than the optimal transition cost
the cost function that the parser should use to evaluate the transitions
Determines a set of "promising" walks through a finite-state machine.
Determines a set of "promising" walks through a finite-state machine.
The return value is a set of "good" walks, each associated with a cost value (higher = worse quality).
the walk to continue
any constraints to impose on the returned walks
a set of good walks that satisfy the input constaints, associated with their costs
Like the GreedyTransitionParser, except that it remembers promising transitions that were not taken from the greedy (one-best) walk and returns those to the user.