Spec

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 addConstraints(constraints: ChartConstraints[L]): GrammarAnchoring[L, W]

   Definition Classes

   Spec → GrammarAnchoring

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

    Spec → GrammarAnchoring

11. final def asInstanceOf[T0]: T0

    Definition Classes

    Any

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

13. def binaryRuleRef(ref: Int): Int

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

    Definition Classes

    Spec → GrammarAnchoring

15. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

16. def depIndex(ruleRef: Int): Int

17. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

18. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    Definition Classes

    AnyRef → Any

20. def headIndex(ruleRef: Int): Int

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

    Definition Classes

    GrammarAnchoring

22. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

23. def joinBinaryRuleRef(head: Int, ref: Int): Int

24. def joinBinaryRuleRefs(lexRefs: Array[Int], ruleRefs: Array[Int]): Array[Int]

25. def joinTagRef(head: Int, ref: Int): Int

26. def joinTagRefs(lexRefs: Array[Int], ruleRefs: Array[Int]): Array[Int]

27. def joinUnaryRuleRef(head: Int, ref: Int): Int

28. def joinUnaryRuleRefs(lexRefs: Array[Int], ruleRefs: Array[Int]): Array[Int]

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

    Definition Classes

    Spec → GrammarAnchoring

30. def length: Int

    Definition Classes

    GrammarAnchoring

31. val lexicon: Lexicon[L, W]

    Definition Classes

    Spec → GrammarAnchoring

32. def logPartition: Double

    Definition Classes

    GrammarAnchoring

33. def marginal: RefinedChartMarginal[L, W]

    Definition Classes

    GrammarAnchoring

34. def maxLabelRefinements: Int

    Definition Classes

    GrammarAnchoring

35. def maxMarginal: RefinedChartMarginal[L, W]

    Definition Classes

    GrammarAnchoring

36. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

37. final def notify(): Unit

    Definition Classes

    AnyRef

38. final def notifyAll(): Unit

    Definition Classes

    AnyRef

39. def numValidRefinements(label: Int): Int

    Definition Classes

    Spec → GrammarAnchoring

40. def numValidRuleRefinements(rule: Int): Int

    Definition Classes

    Spec → GrammarAnchoring

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

    Definition Classes

    Spec → GrammarAnchoring

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

    Definition Classes

    Spec → GrammarAnchoring

43. val ruleCache: TriangularArray[Array[OpenAddressHashArray[Double]]]

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

    Spec → GrammarAnchoring

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

    Spec → GrammarAnchoring

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

    Spec → GrammarAnchoring

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

    Spec → GrammarAnchoring

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

    Spec → GrammarAnchoring

49. val sparsityPattern: ChartConstraints[L]

    Definition Classes

    Spec → GrammarAnchoring

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

    Definition Classes

    AnyRef

51. def tagConstraints: TagConstraints[L]

    Definition Classes

    GrammarAnchoring

52. def tagRef(ref: Int): Int

53. val topology: RuleTopology[L]

    Definition Classes

    Spec → GrammarAnchoring

54. def unaryHeadIndex(ref: Int): Int

55. def unaryRuleRef(ref: Int): Int

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

    Definition Classes

    Spec → GrammarAnchoring

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

    Spec → GrammarAnchoring

58. def validLeftChildRefinementsGivenRule(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int): Array[Int]

    Definition Classes

    Spec → GrammarAnchoring

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

    Definition Classes

    Spec → GrammarAnchoring

60. def validRightChildRefinementsGivenRule(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int): Array[Int]

    Definition Classes

    Spec → GrammarAnchoring

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

    Definition Classes

    Spec → GrammarAnchoring

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

    Definition Classes

    Spec → GrammarAnchoring

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

    Spec → GrammarAnchoring

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

    Definition Classes

    Spec → GrammarAnchoring

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

    Definition Classes

    Spec → GrammarAnchoring

66. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

67. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

68. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

69. val words: IndexedSeq[W]

    Definition Classes

    Spec → GrammarAnchoring