org.allenai.nlpstack.parse.poly.polyparser

RerankingTransitionParser

case class RerankingTransitionParser(config: ParserConfiguration) extends TransitionParser with Product with Serializable

Uses the parser model to create an n-best list, then chooses the best parse from this n-best list (according to the reranking function).

config

configuration object for the parser

Linear Supertypes
Serializable, Serializable, Product, Equals, TransitionParser, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RerankingTransitionParser
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. TransitionParser
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RerankingTransitionParser(config: ParserConfiguration)

    config

    configuration object for the parser

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. val baseParser: NbestSearch

  8. def clone(): AnyRef

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

  9. val config: ParserConfiguration

    configuration object for the parser

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

    Definition Classes
    AnyRef

  11. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  13. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  17. def parse(sentence: Sentence, constraints: Set[TransitionConstraint] = Set()): Option[PolytreeParse]

    Given an initial state, this returns the "best" sequence of Transitions that one should apply to the initial state in order to get a polytree parse.

    Given an initial state, this returns the "best" sequence of Transitions that one should apply to the initial state in order to get a polytree parse. The adjective "best" depends on the specific implementation of the TransitionParser.

    sentence

    the sentence you want to parse

    constraints

    a set of ParserConstraint objects, which constrain the choices the parser may make

    returns

    the "best" list of Transitions you should apply to the initial state (or None if a parse failure occurs)

    Definition Classes
    RerankingTransitionParser → TransitionParser

  18. def parseStringSequence(tokens: Seq[String], constraints: Set[TransitionConstraint] = Set()): Option[PolytreeParse]

    Definition Classes
    TransitionParser

  19. val reranker: Reranker

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

    Definition Classes
    AnyRef

  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 Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from TransitionParser

Inherited from AnyRef

Inherited from Any

Ungrouped