LatentTreeMarginal

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. val anchoring: GrammarAnchoring[L, W]

   Definition Classes

   LatentTreeMarginal → ParseMarginal

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   Definition Classes

   AnyRef

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

    Definition Classes

    ParseMarginal

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

    Definition Classes

    ParseMarginal

12. def expectedRuleCounts: StandardExpectedCounts[Rule[L]]

    Definition Classes

    ParseMarginal

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

    Definition Classes

    LatentTreeMarginal → ParseMarginal

14. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

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

    Definition Classes

    LatentTreeMarginal → ParseMarginal

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

    Definition Classes

    LatentTreeMarginal → ParseMarginal

18. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

19. def isMaxMarginal: Boolean

    Definition Classes

    LatentTreeMarginal → ParseMarginal

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

    Definition Classes

    ParseMarginal

21. def length: Int

    Definition Classes

    ParseMarginal

22. def lexicon: Lexicon[L, W]

    Definition Classes

    ParseMarginal

23. val logPartition: Double

    Definition Classes

    LatentTreeMarginal → ParseMarginal → Marginal

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

    Definition Classes

    AnyRef

25. final def notify(): Unit

    Definition Classes

    AnyRef

26. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

28. def topology: RuleTopology[L]

    Definition Classes

    ParseMarginal

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

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

    spanVisitor

    Definition Classes

    ParseMarginal → VisitableMarginal

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

    spanVisitor

    Definition Classes

    LatentTreeMarginal → ParseMarginal

32. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

35. def words: IndexedSeq[W]

    Definition Classes

    ParseMarginal