case class LatentTreeMarginal[L, W](anchoring: GrammarAnchoring[L, W], tree: BinarizedTree[IndexedSeq[(L, Int)]]) extends ParseMarginal[L, W] with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- LatentTreeMarginal
- Serializable
- Serializable
- Product
- Equals
- ParseMarginal
- VisitableMarginal
- Marginal
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new LatentTreeMarginal(anchoring: GrammarAnchoring[L, W], tree: BinarizedTree[IndexedSeq[(L, Int)]])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
val
anchoring: GrammarAnchoring[L, W]
- Definition Classes
- LatentTreeMarginal → ParseMarginal
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
expectedCounts[Feat](featurizer: RefinedFeaturizer[L, W, Feat], counts: StandardExpectedCounts[Feat], scale: Double): StandardExpectedCounts[Feat]
- Definition Classes
- ParseMarginal
-
def
expectedCounts[Feat](featurizer: RefinedFeaturizer[L, W, Feat]): StandardExpectedCounts[Feat]
- Definition Classes
- ParseMarginal
-
def
expectedRuleCounts: StandardExpectedCounts[Rule[L]]
- Definition Classes
- ParseMarginal
-
def
feasibleSplitPoints(begin: Int, end: Int, leftChild: Int, leftChildRef: Int, rightChild: Int, rightChildRef: Int): IndexedSeq[Int]
- Definition Classes
- LatentTreeMarginal → ParseMarginal
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
insideBotScore(begin: Int, end: Int, sym: Int, ref: Int): Double
- Definition Classes
- LatentTreeMarginal → ParseMarginal
-
def
insideTopScore(begin: Int, end: Int, sym: Int, ref: Int): Double
- Definition Classes
- LatentTreeMarginal → ParseMarginal
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isMaxMarginal: Boolean
- Definition Classes
- LatentTreeMarginal → ParseMarginal
-
def
labelMarginals: (TriangularArray[Counter[L, Double]], TriangularArray[Counter[L, Double]])
- Definition Classes
- ParseMarginal
-
def
length: Int
- Definition Classes
- ParseMarginal
-
def
lexicon: Lexicon[L, W]
- Definition Classes
- ParseMarginal
-
val
logPartition: Double
- Definition Classes
- LatentTreeMarginal → ParseMarginal → Marginal
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
topology: RuleTopology[L]
- Definition Classes
- ParseMarginal
- val tree: BinarizedTree[IndexedSeq[(L, Int)]]
-
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
-
def
visitPostorder(spanVisitor: AnchoredVisitor[L], threshold: 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
- LatentTreeMarginal → ParseMarginal
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
words: IndexedSeq[W]
- Definition Classes
- ParseMarginal