Packages

class Anchoring extends ProjectionsGrammarAnchoring[L, L2, W]

Linear Supertypes
ProjectionsGrammarAnchoring[L, L2, W], GrammarAnchoring[L, W], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Anchoring
  2. ProjectionsGrammarAnchoring
  3. GrammarAnchoring
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def *(other: UnrefinedGrammarAnchoring[L, W]): GrammarAnchoring[L, W]
    Definition Classes
    GrammarAnchoring
  4. 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
  5. 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
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def actForPos(w: Int, c: Point.Value): DenseVector[Double]
  8. def addConstraints(constraints: ChartConstraints[L]): GrammarAnchoring[L, W]
    Definition Classes
    AnchoringGrammarAnchoring
  9. 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
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. final def childRefinement(rule: Int, ruleRef: Int): Int
  12. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  18. def isConvergedTo(f: GrammarAnchoring[L, W], diff: Double): Boolean
    Definition Classes
    GrammarAnchoring
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. final def leftChildRefinement(rule: Int, ruleRef: Int): Int
  21. def length: Int
    Definition Classes
    GrammarAnchoring
  22. val lexicon: Lexicon[L, W]
    Definition Classes
    AnchoringGrammarAnchoring
  23. def logPartition: Double
    Definition Classes
    GrammarAnchoring
  24. val lspec: RefinedFeaturizer.Anchoring
  25. def marginal: RefinedChartMarginal[L, W]
    Definition Classes
    GrammarAnchoring
  26. def maxLabelRefinements: Int
    Definition Classes
    GrammarAnchoring
  27. def maxMarginal: RefinedChartMarginal[L, W]
    Definition Classes
    GrammarAnchoring
  28. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. final def notify(): Unit
    Definition Classes
    AnyRef
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  31. final def numValidRefinements(label: Int): Int
  32. final def numValidRuleRefinements(rule: Int): Int
  33. final def parentRefinement(rule: Int, ruleRef: Int): Int
  34. val precachedSpanActivations: TriangularArray[DenseVector[Double]]
  35. def refinedTopology: RuleTopology[L2]
    Definition Classes
    AnchoringProjectionsGrammarAnchoring
  36. def refinements: GrammarRefinements[L, L2]
    Definition Classes
    AnchoringProjectionsGrammarAnchoring
  37. final def rightChildRefinement(rule: Int, ruleRef: Int): Int
  38. 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
    ProjectionsGrammarAnchoringGrammarAnchoring
  39. 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
    ProjectionsGrammarAnchoringGrammarAnchoring
  40. 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
    AnchoringGrammarAnchoring
  41. 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
    AnchoringGrammarAnchoring
  42. 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
    AnchoringGrammarAnchoring
  43. def sparsityPattern: ChartConstraints[L]
    Definition Classes
    AnchoringGrammarAnchoring
  44. val sspec: IndexedWordAnchoring[W]
  45. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  46. def tagConstraints: TagConstraints[L]
    Definition Classes
    GrammarAnchoring
  47. def toString(): String
    Definition Classes
    AnyRef → Any
  48. val topology: RuleTopology[L]
    Definition Classes
    AnchoringGrammarAnchoring
  49. final def validCoarseRulesGivenParentRefinement(a: Int, refA: Int): Array[Int]
  50. 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
    ProjectionsGrammarAnchoringGrammarAnchoring
  51. final def validLeftChildRefinementsGivenRule(begin: Int, end: Int, completionBegin: Int, completionEnd: Int, rule: Int): Array[Int]
  52. final def validParentRefinementsGivenRule(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int): Array[Int]
  53. final def validRightChildRefinementsGivenRule(completionBegin: Int, completionEnd: Int, begin: Int, end: Int, rule: Int): Array[Int]
  54. final def validRuleRefinementsGivenLeftChild(begin: Int, split: Int, completionBegin: Int, completionEnd: Int, rule: Int, childRef: Int): Array[Int]
  55. 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
    ProjectionsGrammarAnchoringGrammarAnchoring
  56. def validRuleRefinementsGivenParent(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int, parentRef: Int): Array[Int]
    Definition Classes
    GrammarAnchoring
  57. final def validRuleRefinementsGivenRightChild(completionBegin: Int, completionEnd: Int, split: Int, end: Int, rule: Int, childRef: Int): Array[Int]
  58. final def validUnaryRuleRefinementsGivenChild(begin: Int, end: Int, rule: Int, childRef: Int): Array[Int]
  59. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  60. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  61. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  62. val wordActivations: Array[Array[DenseVector[Double]]]
  63. def words: IndexedSeq[W]
    Definition Classes
    AnchoringGrammarAnchoring

Inherited from ProjectionsGrammarAnchoring[L, L2, W]

Inherited from GrammarAnchoring[L, W]

Inherited from AnyRef

Inherited from Any

Ungrouped