Trait

epic.parser

ProjectionsGrammarAnchoring

Related Doc: package parser

Permalink

trait ProjectionsGrammarAnchoring[L, L2, W] extends GrammarAnchoring[L, W]

TODO

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

Abstract Value Members

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

    Permalink
    Definition Classes
    GrammarAnchoring
  2. abstract def lexicon: Lexicon[L, W]

    Permalink
    Definition Classes
    GrammarAnchoring
  3. abstract def refinedTopology: RuleTopology[L2]

    Permalink
  4. abstract def refinements: GrammarRefinements[L, L2]

    Permalink
  5. abstract def scoreBinaryRule(begin: Int, split: Int, end: Int, rule: Int, ref: Int): Double

    Permalink

    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
  6. abstract def scoreSpan(begin: Int, end: Int, label: Int, ref: Int): Double

    Permalink

    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
  7. abstract def scoreUnaryRule(begin: Int, end: Int, rule: Int, ref: Int): Double

    Permalink

    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
  8. abstract def sparsityPattern: ChartConstraints[L]

    Permalink
    Definition Classes
    GrammarAnchoring
  9. abstract def topology: RuleTopology[L]

    Permalink
    Definition Classes
    GrammarAnchoring
  10. abstract def words: IndexedSeq[W]

    Permalink
    Definition Classes
    GrammarAnchoring

Concrete Value Members

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

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

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

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

    Permalink

    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]

    Permalink

    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

    Permalink
    Definition Classes
    AnyRef → Any
  7. def annotationTag: Int

    Permalink

    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
  8. final def asInstanceOf[T0]: T0

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

    Permalink
  10. def clone(): AnyRef

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

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

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

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

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

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

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

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

    Permalink
  19. def length: Int

    Permalink
    Definition Classes
    GrammarAnchoring
  20. def logPartition: Double

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

    Permalink
    Definition Classes
    GrammarAnchoring
  22. def maxLabelRefinements: Int

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

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

    Permalink
    Definition Classes
    AnyRef
  25. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  26. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  27. final def numValidRefinements(label: Int): Int

    Permalink
  28. final def numValidRuleRefinements(rule: Int): Int

    Permalink
  29. final def parentRefinement(rule: Int, ruleRef: Int): Int

    Permalink
  30. final def rightChildRefinement(rule: Int, ruleRef: Int): Int

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

    Permalink

    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
  32. final def ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int): Int

    Permalink

    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
  33. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  34. def tagConstraints: TagConstraints[L]

    Permalink
    Definition Classes
    GrammarAnchoring
  35. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  36. final def validCoarseRulesGivenParentRefinement(a: Int, refA: Int): Array[Int]

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

    Permalink

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

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

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

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

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

    Permalink

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

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

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

    Permalink
  46. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from GrammarAnchoring[L, W]

Inherited from AnyRef

Inherited from Any

Ungrouped