Packages

case class Anchoring[L, L2, W](grammar: SimpleGrammar[L, L2, W], words: IndexedSeq[W], sparsityPattern: ChartConstraints[L]) extends ProjectionsGrammarAnchoring[L, L2, W] with Product with Serializable

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

Instance Constructors

  1. new Anchoring(grammar: SimpleGrammar[L, L2, W], words: IndexedSeq[W], sparsityPattern: 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 addConstraints(constraints: ChartConstraints[L]): GrammarAnchoring[L, W]
    Definition Classes
    Anchoring → GrammarAnchoring
  8. 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
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. final def childRefinement(rule: Int, ruleRef: Int): Int
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  11. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate() @throws( ... )
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  14. val grammar: SimpleGrammar[L, L2, W]
  15. def isConvergedTo(f: GrammarAnchoring[L, W], diff: Double): Boolean
    Definition Classes
    GrammarAnchoring
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. final def leftChildRefinement(rule: Int, ruleRef: Int): Int
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  18. def length: Int
    Definition Classes
    GrammarAnchoring
  19. def lexicon: Lexicon[L, W]
    Definition Classes
    Anchoring → GrammarAnchoring
  20. def logPartition: Double
    Definition Classes
    GrammarAnchoring
  21. def marginal: RefinedChartMarginal[L, W]
    Definition Classes
    GrammarAnchoring
  22. def maxLabelRefinements: Int
    Definition Classes
    GrammarAnchoring
  23. def maxMarginal: RefinedChartMarginal[L, W]
    Definition Classes
    GrammarAnchoring
  24. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  26. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  27. final def numValidRefinements(label: Int): Int
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  28. final def numValidRuleRefinements(rule: Int): Int
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  29. final def parentRefinement(rule: Int, ruleRef: Int): Int
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  30. def refinedTopology: RuleTopology[L2]
    Definition Classes
    Anchoring → ProjectionsGrammarAnchoring
  31. def refinements: GrammarRefinements[L, L2]
    Definition Classes
    Anchoring → ProjectionsGrammarAnchoring
  32. final def rightChildRefinement(rule: Int, ruleRef: Int): Int
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  33. 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
  34. 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
  35. 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
    Anchoring → GrammarAnchoring
  36. 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
    Anchoring → GrammarAnchoring
  37. 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
    Anchoring → GrammarAnchoring
  38. val sparsityPattern: ChartConstraints[L]
    Definition Classes
    Anchoring → GrammarAnchoring
  39. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  40. def tagConstraints: TagConstraints[L]
    Definition Classes
    GrammarAnchoring
  41. def toString(): String
    Definition Classes
    Anchoring → AnyRef → Any
  42. def topology: RuleTopology[L]
    Definition Classes
    Anchoring → GrammarAnchoring
  43. final def validCoarseRulesGivenParentRefinement(a: Int, refA: Int): Array[Int]
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  44. 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
  45. final def validLeftChildRefinementsGivenRule(begin: Int, end: Int, completionBegin: Int, completionEnd: Int, rule: Int): Array[Int]
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  46. final def validParentRefinementsGivenRule(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int): Array[Int]
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  47. final def validRightChildRefinementsGivenRule(completionBegin: Int, completionEnd: Int, begin: Int, end: Int, rule: Int): Array[Int]
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  48. final def validRuleRefinementsGivenLeftChild(begin: Int, split: Int, completionBegin: Int, completionEnd: Int, rule: Int, childRef: Int): Array[Int]
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  49. 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
  50. def validRuleRefinementsGivenParent(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int, parentRef: Int): Array[Int]
    Definition Classes
    GrammarAnchoring
  51. final def validRuleRefinementsGivenRightChild(completionBegin: Int, completionEnd: Int, split: Int, end: Int, rule: Int, childRef: Int): Array[Int]
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  52. final def validUnaryRuleRefinementsGivenChild(begin: Int, end: Int, rule: Int, childRef: Int): Array[Int]
    Definition Classes
    ProjectionsGrammarAnchoring → GrammarAnchoring
  53. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  54. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  55. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  56. val words: IndexedSeq[W]
    Definition Classes
    Anchoring → GrammarAnchoring

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from ProjectionsGrammarAnchoring[L, L2, W]

Inherited from GrammarAnchoring[L, W]

Inherited from AnyRef

Inherited from Any

Ungrouped