Anchoring

Instance Constructors

new Anchoring(w: IndexedSeq[W], cons: ChartConstraints[L])

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
def *(other: UnrefinedGrammarAnchoring[L, W]): GrammarAnchoring[L, W]

Definition Classes
GrammarAnchoring
def *(other: GrammarAnchoring[L, W]): GrammarAnchoring[L, W]

Computes the pointwise product of two grammars, augmenting their refinement space to reflect this.
Computes the pointwise product of two grammars, augmenting their refinement space to reflect this. If they share the same annotationTag, (assuming it's non-negative) they will share their state space. (That is, they will have the same annotations.)
other
returns

Definition Classes
GrammarAnchoring
def /(other: GrammarAnchoring[L, W]): GrammarAnchoring[L, W]

Computes the pointwise division of two grammars, augmenting their refinement space to reflect this.
Computes the pointwise division of two grammars, augmenting their refinement space to reflect this. If they share the same annotationTag, (assuming it's non-negative) they will share their state space. (That is, they will have the same annotations.)
other
returns

Definition Classes
GrammarAnchoring
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
def actForPos(w: Int, c: Point.Value): DenseVector[Double]
def addConstraints(constraints: ChartConstraints[L]): GrammarAnchoring[L, W]

Definition Classes
Anchoring → GrammarAnchoring
def annotationTag: Int

The annotationTag controls if two grammars are over the same refinements.
The annotationTag controls if two grammars are over the same refinements. If they are, then * and / can be much faster.
Note that 0 is reserved for unrefined anchorings, and -1 never matches other tags.
Reserved: 1 - Lexicalized Parsers with no symbol or rule annotation
0's will be optimized

Definition Classes
GrammarAnchoring
final def asInstanceOf[T0]: T0

Definition Classes
Any
final def childRefinement(rule: Int, ruleRef: Int): Int

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
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 hashCode(): Int

Definition Classes
AnyRef → Any
def isConvergedTo(f: GrammarAnchoring[L, W], diff: Double): Boolean

Definition Classes
GrammarAnchoring
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def leftChildRefinement(rule: Int, ruleRef: Int): Int

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
def length: Int

Definition Classes
GrammarAnchoring
val lexicon: Lexicon[L, W]

Definition Classes
Anchoring → GrammarAnchoring
def logPartition: Double

Definition Classes
GrammarAnchoring
val lspec: RefinedFeaturizer.Anchoring
def marginal: RefinedChartMarginal[L, W]

Definition Classes
GrammarAnchoring
def maxLabelRefinements: Int

Definition Classes
GrammarAnchoring
def maxMarginal: RefinedChartMarginal[L, W]

Definition Classes
GrammarAnchoring
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 numValidRefinements(label: Int): Int

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def numValidRuleRefinements(rule: Int): Int

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def parentRefinement(rule: Int, ruleRef: Int): Int

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
val precachedSpanActivations: TriangularArray[DenseVector[Double]]
def refinedTopology: RuleTopology[L2]

Definition Classes
Anchoring → ProjectionsGrammarAnchoring
def refinements: GrammarRefinements[L, L2]

Definition Classes
Anchoring → ProjectionsGrammarAnchoring
final def rightChildRefinement(rule: Int, ruleRef: Int): Int

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int, refC: Int): Int

Returns the refined rule given parent and child refinements for a unary rule.
Returns the refined rule given parent and child refinements for a unary rule. May return -1 if no such rule is allowed.
r
rule Index
refA
parent index
refB
left child index
refC
right child index
returns
rule refinement id, or -1 if rule is not allowed with those refinements

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int): Int

Returns the refined rule given parent and child refinements for a unary rule.
Returns the refined rule given parent and child refinements for a unary rule. May return -1 if no such rule is allowed.
r
rule index
refA
parent index
refB
child index
returns
rule refinement id, or -1 if rule is not allowed with those refinements

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
def scoreBinaryRule(begin: Int, split: Int, end: Int, rule: Int, ref: Int): Double

Scores the indexed epic.trees.BinaryRule rule when it occurs at (begin, split, end)
Scores the indexed epic.trees.BinaryRule rule when it occurs at (begin, split, end)

Definition Classes
Anchoring → GrammarAnchoring
def scoreSpan(begin: Int, end: Int, tag: Int, ref: Int): Double

Scores the indexed label rule with refinenemnt ref, when it occurs at (begin, end).
Scores the indexed label rule with refinenemnt ref, when it occurs at (begin, end). Can be used for s, or for a "bottom" label. Mainly used for s.

Definition Classes
Anchoring → GrammarAnchoring
def scoreUnaryRule(begin: Int, end: Int, rule: Int, ref: Int): Double

Scores the indexed epic.trees.UnaryRule rule when it occurs at (begin, end)
Scores the indexed epic.trees.UnaryRule rule when it occurs at (begin, end)

Definition Classes
Anchoring → GrammarAnchoring
def sparsityPattern: ChartConstraints[L]

Definition Classes
Anchoring → GrammarAnchoring
val sspec: IndexedWordAnchoring[W]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tagConstraints: TagConstraints[L]

Definition Classes
GrammarAnchoring
def toString(): String

Definition Classes
AnyRef → Any
val topology: RuleTopology[L]

Definition Classes
Anchoring → GrammarAnchoring
final def validCoarseRulesGivenParentRefinement(a: Int, refA: Int): Array[Int]

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def validLabelRefinements(begin: Int, end: Int, label: Int): Array[Int]

For a given span, what refinements to the label are allowed? Refinements in general are in the range (0, numValidRefinements).
For a given span, what refinements to the label are allowed? Refinements in general are in the range (0, numValidRefinements). This method may return a subset.
returns
array of valid refinements. Don't modify!

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def validLeftChildRefinementsGivenRule(begin: Int, end: Int, completionBegin: Int, completionEnd: Int, rule: Int): Array[Int]

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def validParentRefinementsGivenRule(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int): Array[Int]

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def validRightChildRefinementsGivenRule(completionBegin: Int, completionEnd: Int, begin: Int, end: Int, rule: Int): Array[Int]

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def validRuleRefinementsGivenLeftChild(begin: Int, split: Int, completionBegin: Int, completionEnd: Int, rule: Int, childRef: Int): Array[Int]

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def validRuleRefinementsGivenParent(begin: Int, end: Int, rule: Int, parentRef: Int): Array[Int]

For a given span and the parent's refinement, what refinements to the rule are allowed?
For a given span and the parent's refinement, what refinements to the rule are allowed?
begin
end
rule
returns

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
def validRuleRefinementsGivenParent(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int, parentRef: Int): Array[Int]

Definition Classes
GrammarAnchoring
final def validRuleRefinementsGivenRightChild(completionBegin: Int, completionEnd: Int, split: Int, end: Int, rule: Int, childRef: Int): Array[Int]

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
final def validUnaryRuleRefinementsGivenChild(begin: Int, end: Int, rule: Int, childRef: Int): Array[Int]

Definition Classes
ProjectionsGrammarAnchoring → GrammarAnchoring
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( ... )
val wordActivations: Array[Array[DenseVector[Double]]]
def words: IndexedSeq[W]

Definition Classes
Anchoring → GrammarAnchoring

class Anchoring extends ProjectionsGrammarAnchoring[L, L2, W]

Instance Constructors

new Anchoring(w: IndexedSeq[W], cons: ChartConstraints[L])

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def *(other: UnrefinedGrammarAnchoring[L, W]): GrammarAnchoring[L, W]

def *(other: GrammarAnchoring[L, W]): GrammarAnchoring[L, W]

def /(other: GrammarAnchoring[L, W]): GrammarAnchoring[L, W]

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def actForPos(w: Int, c: Point.Value): DenseVector[Double]

def addConstraints(constraints: ChartConstraints[L]): GrammarAnchoring[L, W]

def annotationTag: Int

final def asInstanceOf[T0]: T0

final def childRefinement(rule: Int, ruleRef: Int): Int

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def isConvergedTo(f: GrammarAnchoring[L, W], diff: Double): Boolean

final def isInstanceOf[T0]: Boolean

final def leftChildRefinement(rule: Int, ruleRef: Int): Int

def length: Int

val lexicon: Lexicon[L, W]

def logPartition: Double

val lspec: RefinedFeaturizer.Anchoring

def marginal: RefinedChartMarginal[L, W]

def maxLabelRefinements: Int

def maxMarginal: RefinedChartMarginal[L, W]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def numValidRefinements(label: Int): Int

final def numValidRuleRefinements(rule: Int): Int

final def parentRefinement(rule: Int, ruleRef: Int): Int

val precachedSpanActivations: TriangularArray[DenseVector[Double]]

def refinedTopology: RuleTopology[L2]

def refinements: GrammarRefinements[L, L2]

final def rightChildRefinement(rule: Int, ruleRef: Int): Int

final def ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int, refC: Int): Int

final def ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int): Int

def scoreBinaryRule(begin: Int, split: Int, end: Int, rule: Int, ref: Int): Double

def scoreSpan(begin: Int, end: Int, tag: Int, ref: Int): Double

def scoreUnaryRule(begin: Int, end: Int, rule: Int, ref: Int): Double

def sparsityPattern: ChartConstraints[L]

val sspec: IndexedWordAnchoring[W]

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

def tagConstraints: TagConstraints[L]

def toString(): String

val topology: RuleTopology[L]

final def validCoarseRulesGivenParentRefinement(a: Int, refA: Int): Array[Int]

final def validLabelRefinements(begin: Int, end: Int, label: Int): Array[Int]

final def validLeftChildRefinementsGivenRule(begin: Int, end: Int, completionBegin: Int, completionEnd: Int, rule: Int): Array[Int]

final def validParentRefinementsGivenRule(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int): Array[Int]

final def validRightChildRefinementsGivenRule(completionBegin: Int, completionEnd: Int, begin: Int, end: Int, rule: Int): Array[Int]

final def validRuleRefinementsGivenLeftChild(begin: Int, split: Int, completionBegin: Int, completionEnd: Int, rule: Int, childRef: Int): Array[Int]

final def validRuleRefinementsGivenParent(begin: Int, end: Int, rule: Int, parentRef: Int): Array[Int]

def validRuleRefinementsGivenParent(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int, parentRef: Int): Array[Int]

final def validRuleRefinementsGivenRightChild(completionBegin: Int, completionEnd: Int, split: Int, end: Int, rule: Int, childRef: Int): Array[Int]

final def validUnaryRuleRefinementsGivenChild(begin: Int, end: Int, rule: Int, childRef: Int): Array[Int]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val wordActivations: Array[Array[DenseVector[Double]]]

def words: IndexedSeq[W]

Inherited from ProjectionsGrammarAnchoring[L, L2, W]

Inherited from GrammarAnchoring[L, W]

Inherited from AnyRef

Inherited from Any

Ungrouped