trait ProjectionsGrammarAnchoring[L, L2, W] extends GrammarAnchoring[L, W]
TODO
- Alphabetic
- By Inheritance
- ProjectionsGrammarAnchoring
- GrammarAnchoring
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
addConstraints(constraints: ChartConstraints[L]): GrammarAnchoring[L, W]
- Definition Classes
- GrammarAnchoring
-
abstract
def
lexicon: Lexicon[L, W]
- Definition Classes
- GrammarAnchoring
- abstract def refinedTopology: RuleTopology[L2]
- abstract def refinements: GrammarRefinements[L, L2]
-
abstract
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
- GrammarAnchoring
-
abstract
def
scoreSpan(begin: Int, end: Int, label: 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
- GrammarAnchoring
-
abstract
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
- GrammarAnchoring
-
abstract
def
sparsityPattern: ChartConstraints[L]
- Definition Classes
- GrammarAnchoring
-
abstract
def
topology: RuleTopology[L]
- Definition Classes
- GrammarAnchoring
-
abstract
def
words: IndexedSeq[W]
- Definition Classes
- GrammarAnchoring
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → 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.)
- 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.)
- Definition Classes
- GrammarAnchoring
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
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
-
def
logPartition: Double
- Definition Classes
- GrammarAnchoring
-
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
-
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
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tagConstraints: TagConstraints[L]
- Definition Classes
- GrammarAnchoring
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
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?
- 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( ... )