epic.parser.projections

EnumeratedAnchoring

case class EnumeratedAnchoring[L, W](topology: RuleTopology[L], lexicon: Lexicon[L, W], words: IndexedSeq[W], spanScores: Array[OpenAddressHashArray[Double]], unaryScores: Array[OpenAddressHashArray[Double]], binaryScores: Array[Array[OpenAddressHashArray[Double]]], sparsityPattern: ChartConstraints[L]) extends UnrefinedGrammarAnchoring[L, W] with Serializable with Product with Serializable

An epic.parser.projections.EnumeratedAnchoring is a compressed forest, with potentially distinct rule and span scores for every possible anchoring.

L
W

Annotations
@SerialVersionUID( 3 )
Linear Supertypes
Serializable, Product, Equals, Serializable, UnrefinedGrammarAnchoring[L, W], Factor[UnrefinedGrammarAnchoring[L, W]], GrammarAnchoring[L, W], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EnumeratedAnchoring
  2. Serializable
  3. Product
  4. Equals
  5. Serializable
  6. UnrefinedGrammarAnchoring
  7. Factor
  8. GrammarAnchoring
  9. AnyRef
  10. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EnumeratedAnchoring(topology: RuleTopology[L], lexicon: Lexicon[L, W], words: IndexedSeq[W], spanScores: Array[OpenAddressHashArray[Double]], unaryScores: Array[OpenAddressHashArray[Double]], binaryScores: Array[Array[OpenAddressHashArray[Double]]], sparsityPattern: ChartConstraints[L])

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

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

  7. 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

  8. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  10. 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

  11. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  12. val binaryScores: Array[Array[OpenAddressHashArray[Double]]]

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

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

  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 finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  17. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  18. 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

  19. def isConvergedTo(f: GrammarAnchoring[L, W], diff: Double): Boolean

    Definition Classes
    GrammarAnchoring

  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  21. final def leftChildRefinement(rule: Int, ruleRef: Int): Int

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

  22. def length: Int

    Definition Classes
    GrammarAnchoring

  23. val lexicon: Lexicon[L, W]

    Definition Classes
    EnumeratedAnchoring → UnrefinedGrammarAnchoring → GrammarAnchoring

  24. def logPartition: Double

    Definition Classes
    GrammarAnchoring

  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

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

  32. final def numValidRuleRefinements(rule: Int): Int

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

  33. final def parentRefinement(rule: Int, ruleRef: Int): Int

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

  34. final def rightChildRefinement(rule: Int, ruleRef: Int): Int

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

  35. 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

  36. 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

  37. 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
    EnumeratedAnchoring → UnrefinedGrammarAnchoring

  38. 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

  39. 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
    EnumeratedAnchoring → UnrefinedGrammarAnchoring

  40. 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

  41. 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
    EnumeratedAnchoring → UnrefinedGrammarAnchoring

  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
    UnrefinedGrammarAnchoring → GrammarAnchoring

  43. val spanScores: Array[OpenAddressHashArray[Double]]

  44. val sparsityPattern: ChartConstraints[L]

    Definition Classes
    EnumeratedAnchoring → GrammarAnchoring

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

    Definition Classes
    AnyRef

  46. def tagConstraints: TagConstraints[L]

    Definition Classes
    GrammarAnchoring

  47. val topology: RuleTopology[L]

    Definition Classes
    EnumeratedAnchoring → UnrefinedGrammarAnchoring → GrammarAnchoring

  48. val unaryScores: Array[OpenAddressHashArray[Double]]

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

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

  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
    UnrefinedGrammarAnchoring → GrammarAnchoring

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

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

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

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

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

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

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

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

  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?

    begin
    end
    rule
    returns

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

  56. def validRuleRefinementsGivenParent(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int, parentRef: Int): Array[Int]

    Definition Classes
    GrammarAnchoring

  57. def validRuleRefinementsGivenRightChild(completionBegin: Int, completionEnd: Int, split: Int, end: Int, rule: Int, childRef: Int): Array[Int]

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

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

    Definition Classes
    UnrefinedGrammarAnchoring → GrammarAnchoring

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

    Definition Classes
    EnumeratedAnchoring → UnrefinedGrammarAnchoring → GrammarAnchoring

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Serializable

Inherited from UnrefinedGrammarAnchoring[L, W]

Inherited from Factor[UnrefinedGrammarAnchoring[L, W]]

Inherited from GrammarAnchoring[L, W]

Inherited from AnyRef

Inherited from Any

Ungrouped