Identity

Instance Constructors

new Identity(topology: RuleTopology[L], lexicon: Lexicon[L, W], words: IndexedSeq[W], sparsityPattern: ChartConstraints[L])

topology
lexicon
words

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

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

Computes the point-wise product of this grammar with some other grammar.
Computes the point-wise product of this grammar with some other grammar.
Note that scores are in log space, so we actually sum scores.
other
returns

Definition Classes
UnrefinedGrammarAnchoring → Factor → 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: UnrefinedGrammarAnchoring[L, W]): UnrefinedGrammarAnchoring[L, W]

Computes the point-wise division of this grammar with some other grammar.
Computes the point-wise division of this grammar with some other grammar.
Note that scores are in log space, so we actually subtract scores.
other
returns

Definition Classes
UnrefinedGrammarAnchoring → Factor
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: Any): Boolean

Definition Classes
AnyRef → Any
def addConstraints(cs: ChartConstraints[L]): UnrefinedGrammarAnchoring[L, W]

Definition Classes
Identity → UnrefinedGrammarAnchoring → 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
UnrefinedGrammarAnchoring → GrammarAnchoring
final def asInstanceOf[T0]: T0

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

Definition Classes
UnrefinedGrammarAnchoring → GrammarAnchoring
def clone(): AnyRef

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

Definition Classes
AnyRef
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 isConvergedTo(f: UnrefinedGrammarAnchoring[L, W], diff: Double): Boolean

Is this CoreAnchoring nearly the same as that core anchoring?
Is this CoreAnchoring nearly the same as that core anchoring?

Definition Classes
UnrefinedGrammarAnchoring → Factor
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
UnrefinedGrammarAnchoring → GrammarAnchoring
def length: Int

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

Definition Classes
Identity → UnrefinedGrammarAnchoring → 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
UnrefinedGrammarAnchoring → GrammarAnchoring
final def numValidRuleRefinements(rule: Int): Int

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

Definition Classes
UnrefinedGrammarAnchoring → GrammarAnchoring
final def rightChildRefinement(rule: Int, ruleRef: Int): Int

Definition Classes
UnrefinedGrammarAnchoring → 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
UnrefinedGrammarAnchoring → 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
UnrefinedGrammarAnchoring → GrammarAnchoring
def scoreBinaryRule(begin: Int, split: Int, end: Int, rule: 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
Identity → UnrefinedGrammarAnchoring
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
UnrefinedGrammarAnchoring → GrammarAnchoring
def scoreSpan(begin: Int, end: Int, tag: Int): Double

Scores the indexed label rule when it occurs at (begin,end).
Scores the indexed label rule when it occurs at (begin,end). Can be used for tags, or for a "bottom" label. Typically it is used to filter out impossible rules (using Double.NegativeInfinity)

Definition Classes
Identity → UnrefinedGrammarAnchoring
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
UnrefinedGrammarAnchoring → GrammarAnchoring
def scoreUnaryRule(begin: Int, end: Int, rule: 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
Identity → UnrefinedGrammarAnchoring
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
UnrefinedGrammarAnchoring → GrammarAnchoring
val sparsityPattern: ChartConstraints[L]

Definition Classes
Identity → GrammarAnchoring
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tagConstraints: TagConstraints[L]

Definition Classes
GrammarAnchoring
val topology: RuleTopology[L]

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

Definition Classes
UnrefinedGrammarAnchoring → 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
UnrefinedGrammarAnchoring → GrammarAnchoring
def validLeftChildRefinementsGivenRule(begin: Int, end: Int, completionBegin: Int, completionEnd: Int, rule: Int): Array[Int]

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

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

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

Definition Classes
UnrefinedGrammarAnchoring → 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
UnrefinedGrammarAnchoring → GrammarAnchoring
def validRuleRefinementsGivenParent(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int, parentRef: Int): Array[Int]

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

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

Definition Classes
UnrefinedGrammarAnchoring → 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 words: IndexedSeq[W]

Definition Classes
Identity → UnrefinedGrammarAnchoring → GrammarAnchoring

case class Identity[L, W](topology: RuleTopology[L], lexicon: Lexicon[L, W], words: IndexedSeq[W], sparsityPattern: ChartConstraints[L]) extends UnrefinedGrammarAnchoring[L, W] with Product with Serializable

Instance Constructors

new Identity(topology: RuleTopology[L], lexicon: Lexicon[L, W], words: IndexedSeq[W], sparsityPattern: ChartConstraints[L])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

final def ==(arg0: Any): Boolean

def addConstraints(cs: ChartConstraints[L]): UnrefinedGrammarAnchoring[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 finalize(): Unit

final def getClass(): Class[_]

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

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

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

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): Double

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

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

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

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

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

val sparsityPattern: ChartConstraints[L]

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

def tagConstraints: TagConstraints[L]

val topology: RuleTopology[L]

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

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

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

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

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

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]

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 words: IndexedSeq[W]

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from UnrefinedGrammarAnchoring[L, W]

Inherited from Factor[UnrefinedGrammarAnchoring[L, W]]

Inherited from GrammarAnchoring[L, W]

Inherited from AnyRef

Inherited from Any

Ungrouped