final case class RefinedChartMarginal[L, W](anchoring: GrammarAnchoring[L, W], inside: RefinedParseChart[L], outside: RefinedParseChart[L], logPartition: Double, isMaxMarginal: Boolean) extends ParseMarginal[L, W] with SerializableLogging with Product with Serializable

Holds the information for the marginals for a sentence. That is, the inside and outside scores for a sentence and anchoring.

L

the label type

W

the word type

anchoring

the specialized grammar used to construct the marginals for this sentence

inside

inside chart

outside

outside chart

logPartition

the normalization constant aka inside score of the root aka probability of the sentence

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

Instance Constructors

  1. new RefinedChartMarginal(anchoring: GrammarAnchoring[L, W], inside: RefinedParseChart[L], outside: RefinedParseChart[L], logPartition: Double, isMaxMarginal: Boolean)

    anchoring

    the specialized grammar used to construct the marginals for this sentence

    inside

    inside chart

    outside

    outside chart

    logPartition

    the normalization constant aka inside score of the root aka probability of the sentence

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. val anchoring: GrammarAnchoring[L, W]
    Definition Classes
    RefinedChartMarginal → ParseMarginal
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def checkForSimpleTree(tree: BinarizedTree[L]): RefinedChartMarginal[L, W]
  7. def checkForTree(tree: BinarizedTree[(L, Int)]): RefinedChartMarginal[L, W]
  8. def checkForTreeOutside(tree: BinarizedTree[(L, Int)]): Unit
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def expectedCounts[Feat](featurizer: RefinedFeaturizer[L, W, Feat], counts: StandardExpectedCounts[Feat], scale: Double): StandardExpectedCounts[Feat]
    Definition Classes
    ParseMarginal
  12. def expectedCounts[Feat](featurizer: RefinedFeaturizer[L, W, Feat]): StandardExpectedCounts[Feat]
    Definition Classes
    ParseMarginal
  13. def expectedRuleCounts: StandardExpectedCounts[Rule[L]]
    Definition Classes
    ParseMarginal
  14. def feasibleSplitPoints(begin: Int, end: Int, leftChild: Int, leftChildRef: Int, rightChild: Int, rightChildRef: Int): IndexedSeq[Int]
    Definition Classes
    RefinedChartMarginal → ParseMarginal
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  17. val inside: RefinedParseChart[L]
  18. def insideBotScore(begin: Int, end: Int, sym: Int, ref: Int): Double
    Definition Classes
    RefinedChartMarginal → ParseMarginal
  19. def insideTopScore(begin: Int, end: Int, sym: Int, ref: Int): Double
    Definition Classes
    RefinedChartMarginal → ParseMarginal
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. val isMaxMarginal: Boolean
    Definition Classes
    RefinedChartMarginal → ParseMarginal
  22. def labelMarginals: (TriangularArray[Counter[L, Double]], TriangularArray[Counter[L, Double]])
    Definition Classes
    ParseMarginal
  23. def length: Int
    Definition Classes
    ParseMarginal
  24. def lexicon: Lexicon[L, W]
    Definition Classes
    ParseMarginal
  25. val logPartition: Double
    Definition Classes
    RefinedChartMarginal → ParseMarginal → Marginal
  26. def logger: LazyLogger
    Attributes
    protected
    Definition Classes
    SerializableLogging
  27. def marginalAt(begin: Int, end: Int): Counter2[L, Int, Double]
  28. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. final def notify(): Unit
    Definition Classes
    AnyRef
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  31. val outside: RefinedParseChart[L]
  32. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  33. def topology: RuleTopology[L]
    Definition Classes
    ParseMarginal
  34. def visit(spanVisitor: AnchoredVisitor[L]): Unit

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

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

    Definition Classes
    ParseMarginal → VisitableMarginal
  35. def visitPostorder(spanVisitor: AnchoredVisitor[L], spanThreshold: Double = Double.NegativeInfinity): Unit

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

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

    Definition Classes
    RefinedChartMarginal → ParseMarginal
  36. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. def words: IndexedSeq[W]
    Definition Classes
    ParseMarginal

Inherited from Product

Inherited from Equals

Inherited from SerializableLogging

Inherited from Serializable

Inherited from Serializable

Inherited from ParseMarginal[L, W]

Inherited from VisitableMarginal[AnchoredVisitor[L]]

Inherited from Marginal

Inherited from AnyRef

Inherited from Any

Ungrouped