RerankingTransitionParser

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. val config: ParserConfiguration

   

   configuration object for the parser

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

   

   Definition Classes

   AnyRef

8. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

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

   

   Definition Classes

   AnyRef → Any

10. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

12. final def notify(): Unit

    

    Definition Classes

    AnyRef

13. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

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

    

    Definition Classes

    TransitionParser

16. def parseWithScore(sentence: Sentence, constraints: Set[TransitionConstraint] = Set(), doFastApproximation: Boolean = false): Option[(PolytreeParse, Double)]

    

17. def possibleArcLabels: Set[Symbol]

    

    Returns all possible arc labels for this transition parser.

    Returns all possible arc labels for this transition parser.

    TODO: currently this is hard-coded for Stanford labels. This should be revised to get these labels from the trained models.

    returns

    the set of all possible arc labels that the parser might use

    Definition Classes

    TransitionParser

18. val reranker: Reranker

    

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

    

    Definition Classes

    AnyRef

20. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )