org.allenai.nlpstack.parse.poly.fsm

NostalgicSearch

Related Doc: package fsm

class NostalgicSearch extends AnyRef

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.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NostalgicSearch
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NostalgicSearch(costFunction: StateCostFunction, qualifyingCostDelta: Double)

    costFunction

    the cost function that the parser should use to evaluate the transitions

    qualifyingCostDelta

    the parser will retain walks for suboptimal transitions whose costs are no worse than qualifyingCostDelta more than the optimal transition cost

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. def completeWalk(walk: Walk, costSoFar: Double, constraints: Set[TransitionConstraint]): Option[Walk]

  7. val costFunction: StateCostFunction

    the cost function that the parser should use to evaluate the transitions

  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  11. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  12. def getPromisingWalks(walk: Walk, costSoFar: Double, constraints: Set[TransitionConstraint] = Set()): (Seq[ScoredWalk], Boolean)

    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).

    walk

    the walk to continue

    constraints

    any constraints to impose on the returned walks

    returns

    a set of good walks that satisfy the input constaints, associated with their costs

  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  15. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  18. final def parseRecursive(initState: Option[State], costSoFar: Double, stepsSoFar: Seq[WalkStep], mementosSoFar: Seq[ScoredWalk], constraints: Set[TransitionConstraint], constraintEncountered: Boolean): (Seq[ScoredWalk], Boolean)

    Attributes
    protected
    Annotations
    @tailrec()

  19. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  20. def toString(): String

    Definition Classes
    AnyRef → Any

  21. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  22. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  23. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped