RefinedChartMarginal

Instance Constructors

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

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]

the specialized grammar used to construct the marginals for this sentence
the specialized grammar used to construct the marginals for this sentence

Definition Classes
RefinedChartMarginal → ParseMarginal
final def asInstanceOf[T0]: T0

Definition Classes
Any
def checkForSimpleTree(tree: BinarizedTree[L]): RefinedChartMarginal[L, W]
def checkForTree(tree: BinarizedTree[(L, Int)]): RefinedChartMarginal[L, W]
def checkForTreeOutside(tree: BinarizedTree[(L, Int)]): Unit
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
RefinedChartMarginal → 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
val inside: RefinedParseChart[L]

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

Definition Classes
RefinedChartMarginal → ParseMarginal
def insideTopScore(begin: Int, end: Int, sym: Int, ref: Int): Double

Definition Classes
RefinedChartMarginal → ParseMarginal
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val isMaxMarginal: Boolean

Definition Classes
RefinedChartMarginal → 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

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

Definition Classes
RefinedChartMarginal → ParseMarginal → Marginal
def logger: Logger

Definition Classes
SafeLogging
def marginalAt(begin: Int, end: Int): Counter2[L, Int, Double]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val outside: RefinedParseChart[L]

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

Definition Classes
AnyRef
def topology: RuleTopology[L]

Definition Classes
ParseMarginal
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], 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
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

Related Docs: object RefinedChartMarginal | package parser

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 SafeLogging with Product with Serializable

Instance Constructors

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

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val anchoring: GrammarAnchoring[L, W]

final def asInstanceOf[T0]: T0

def checkForSimpleTree(tree: BinarizedTree[L]): RefinedChartMarginal[L, W]

def checkForTree(tree: BinarizedTree[(L, Int)]): RefinedChartMarginal[L, W]

def checkForTreeOutside(tree: BinarizedTree[(L, Int)]): Unit

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]

def finalize(): Unit

final def getClass(): Class[_]

val inside: RefinedParseChart[L]

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

val isMaxMarginal: Boolean

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

def length: Int

def lexicon: Lexicon[L, W]

val logPartition: Double

def logger: Logger

def marginalAt(begin: Int, end: Int): Counter2[L, Int, Double]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val outside: RefinedParseChart[L]

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

def topology: RuleTopology[L]

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

def visitPostorder(spanVisitor: AnchoredVisitor[L], spanThreshold: Double = Double.NegativeInfinity): 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 Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from SafeLogging

Inherited from ParseMarginal[L, W]

Inherited from VisitableMarginal[AnchoredVisitor[L]]

Inherited from Marginal

Inherited from AnyRef

Inherited from Any

Ungrouped