epic.parser.models.NeuralModel

Anchoring

class Anchoring[L, W] extends StructureDelegatingAnchoring[L, W]

Not thread safe; make a difference anchoring for each thread

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Anchoring
  2. StructureDelegatingAnchoring
  3. GrammarAnchoring
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Anchoring(baseAnchoring: GrammarAnchoring[L, W], baseFeaturizer: RefinedFeaturizer.Anchoring, labelFeaturizer: RefinedFeaturizer.Anchoring, surfaceFeaturizer: IndexedSplitSpanFeatureAnchoring[W], lastLayer: DenseMatrix[Double], layer: Layer)

Value Members

  1. final def !=(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  3. final def ##(): Int

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

    Definition Classes
    GrammarAnchoring
  5. 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
  6. 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
  7. final def ==(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  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. val baseAnchoring: GrammarAnchoring[L, W]

  12. val baseFeaturizer: RefinedFeaturizer.Anchoring

  13. def childRefinement(rule: Int, ruleRef: Int): Int

  14. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef → Any
  17. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  19. def hashCode(): Int

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

    Definition Classes
    GrammarAnchoring
  21. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  22. val labelFeaturizer: RefinedFeaturizer.Anchoring

  23. val lastLayer: DenseMatrix[Double]

  24. val layer: Layer

  25. def leftChildRefinement(rule: Int, ruleRef: Int): Int

  26. def length: Int

    Definition Classes
    GrammarAnchoring
  27. def lexicon: Lexicon[L, W]

  28. def logPartition: Double

    Definition Classes
    GrammarAnchoring
  29. def marginal: RefinedChartMarginal[L, W]

    Definition Classes
    GrammarAnchoring
  30. def maxLabelRefinements: Int

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

    Definition Classes
    GrammarAnchoring
  32. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  33. final def notify(): Unit

    Definition Classes
    AnyRef
  34. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  35. def numValidRefinements(label: Int): Int

  36. def numValidRuleRefinements(rule: Int): Int

  37. def parentRefinement(rule: Int, ruleRef: Int): Int

  38. def rightChildRefinement(rule: Int, ruleRef: Int): Int

  39. 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
    StructureDelegatingAnchoringGrammarAnchoring
  40. 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
    StructureDelegatingAnchoringGrammarAnchoring
  41. def score(labelFeatures: Array[Int], surfaceFeatures: Array[Int], begin: Int, split: Int, end: Int): Double

  42. 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
  43. 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
    AnchoringGrammarAnchoring
  44. 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
  45. def sparsityPattern: ChartConstraints[L]

    Definition Classes
    AnchoringGrammarAnchoring
  46. val surfaceFeaturizer: IndexedSplitSpanFeatureAnchoring[W]

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

    Definition Classes
    AnyRef
  48. def tagConstraints: TagConstraints[L]

    Definition Classes
    GrammarAnchoring
  49. def toString(): String

    Definition Classes
    AnyRef → Any
  50. def topology: RuleTopology[L]

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

  52. 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
    StructureDelegatingAnchoringGrammarAnchoring
  53. def validLeftChildRefinementsGivenRule(begin: Int, end: Int, completionBegin: Int, completionEnd: Int, rule: Int): Array[Int]

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

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

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

  57. 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
    StructureDelegatingAnchoringGrammarAnchoring
  58. def validRuleRefinementsGivenParent(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int, parentRef: Int): Array[Int]

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

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

  61. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  62. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  63. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  64. def words: IndexedSeq[W]

Inherited from StructureDelegatingAnchoring[L, W]

Inherited from GrammarAnchoring[L, W]

Inherited from AnyRef

Inherited from Any

Ungrouped