Abstract Value Members
-
-
abstract
def
feasibleSplitPoints(begin: Int, end: Int, leftChild: Int, leftChildRef: Int, rightChild: Int, rightChildRef: Int): IndexedSeq[Int]
-
abstract
def
insideBotScore(begin: Int, end: Int, sym: Int, ref: Int): Double
-
abstract
def
insideTopScore(begin: Int, end: Int, sym: Int, ref: Int): Double
-
abstract
def
isMaxMarginal: Boolean
-
abstract
def
logPartition: Double
-
abstract
def
visitPostorder(spanVisitor: AnchoredVisitor[L], spanThreshold: Double = Double.NegativeInfinity): Unit
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
labelMarginals: (TriangularArray[Counter[L, Double]], TriangularArray[Counter[L, Double]])
-
def
length: Int
-
def
lexicon: Lexicon[L, W]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
-
def
visit(spanVisitor: AnchoredVisitor[L]): Unit
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
words: IndexedSeq[W]
Inherited from AnyRef
Inherited from Any
Represents marginals over trees. Can also extract expected counts