LatentTreeMarginal

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val anchoring: GrammarAnchoring[L, W]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def expectedCounts[Feat](featurizer: RefinedFeaturizer[L, W, Feat], counts: StandardExpectedCounts[Feat], scale: Double): StandardExpectedCounts[Feat]

def expectedCounts[Feat](featurizer: RefinedFeaturizer[L, W, Feat]): StandardExpectedCounts[Feat]

def expectedRuleCounts: StandardExpectedCounts[Rule[L]]

def feasibleSplitPoints(begin: Int, end: Int, leftChild: Int, leftChildRef: Int, rightChild: Int, rightChildRef: Int): IndexedSeq[Int]

final def getClass(): Class[_]

def insideBotScore(begin: Int, end: Int, sym: Int, ref: Int): Double

def insideTopScore(begin: Int, end: Int, sym: Int, ref: Int): Double

final def isInstanceOf[T0]: Boolean

def isMaxMarginal: Boolean

def labelMarginals: (TriangularArray[Counter[L, Double]], TriangularArray[Counter[L, Double]])

def length: Int

def lexicon: Lexicon[L, W]

val logPartition: Double

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def topology: RuleTopology[L]

val tree: BinarizedTree[IndexedSeq[(L, Int)]]

def visit(spanVisitor: AnchoredVisitor[L]): Unit

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

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

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

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def words: IndexedSeq[W]

def finalize(): Unit