Class/Object

epic.parser

LatentTreeMarginal

Related Docs: object LatentTreeMarginal | package parser

Permalink

case class LatentTreeMarginal[L, W](anchoring: GrammarAnchoring[L, W], tree: BinarizedTree[IndexedSeq[(L, Int)]]) extends ParseMarginal[L, W] with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, ParseMarginal[L, W], VisitableMarginal[AnchoredVisitor[L]], Marginal, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LatentTreeMarginal
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. ParseMarginal
  7. VisitableMarginal
  8. Marginal
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LatentTreeMarginal(anchoring: GrammarAnchoring[L, W], tree: BinarizedTree[IndexedSeq[(L, Int)]])

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. val anchoring: GrammarAnchoring[L, W]

    Permalink
    Definition Classes
    LatentTreeMarginalParseMarginal
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def expectedCounts[Feat](featurizer: RefinedFeaturizer[L, W, Feat], counts: StandardExpectedCounts[Feat], scale: Double): StandardExpectedCounts[Feat]

    Permalink
    Definition Classes
    ParseMarginal
  9. def expectedCounts[Feat](featurizer: RefinedFeaturizer[L, W, Feat]): StandardExpectedCounts[Feat]

    Permalink
    Definition Classes
    ParseMarginal
  10. def expectedRuleCounts: StandardExpectedCounts[Rule[L]]

    Permalink
    Definition Classes
    ParseMarginal
  11. def feasibleSplitPoints(begin: Int, end: Int, leftChild: Int, leftChildRef: Int, rightChild: Int, rightChildRef: Int): IndexedSeq[Int]

    Permalink
    Definition Classes
    LatentTreeMarginalParseMarginal
  12. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  14. def insideBotScore(begin: Int, end: Int, sym: Int, ref: Int): Double

    Permalink
    Definition Classes
    LatentTreeMarginalParseMarginal
  15. def insideTopScore(begin: Int, end: Int, sym: Int, ref: Int): Double

    Permalink
    Definition Classes
    LatentTreeMarginalParseMarginal
  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  17. def isMaxMarginal: Boolean

    Permalink
    Definition Classes
    LatentTreeMarginalParseMarginal
  18. def labelMarginals: (TriangularArray[Counter[L, Double]], TriangularArray[Counter[L, Double]])

    Permalink
    Definition Classes
    ParseMarginal
  19. def length: Int

    Permalink
    Definition Classes
    ParseMarginal
  20. def lexicon: Lexicon[L, W]

    Permalink
    Definition Classes
    ParseMarginal
  21. val logPartition: Double

    Permalink
    Definition Classes
    LatentTreeMarginalParseMarginalMarginal
  22. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  23. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  24. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  25. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  26. def topology: RuleTopology[L]

    Permalink
    Definition Classes
    ParseMarginal
  27. val tree: BinarizedTree[IndexedSeq[(L, Int)]]

    Permalink
  28. def visit(spanVisitor: AnchoredVisitor[L]): Unit

    Permalink

    Visits the forest (if applicable) in whatever order is appropriate

    Visits the forest (if applicable) in whatever order is appropriate

    Definition Classes
    ParseMarginalVisitableMarginal
  29. def visitPostorder(spanVisitor: AnchoredVisitor[L], threshold: Double = Double.NegativeInfinity): Unit

    Permalink

    Forest traversal that visits spans in a "bottom up" order.

    Forest traversal that visits spans in a "bottom up" order.

    Definition Classes
    LatentTreeMarginalParseMarginal
  30. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. def words: IndexedSeq[W]

    Permalink
    Definition Classes
    ParseMarginal

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from ParseMarginal[L, W]

Inherited from VisitableMarginal[AnchoredVisitor[L]]

Inherited from Marginal

Inherited from AnyRef

Inherited from Any

Ungrouped