Packages

final class ChartScores extends AnyRef

A ChartScores is just a triangular array whose entries are arrays. Admits efficient iteration over "on" elements in an (i, j) index.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ChartScores
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply(begin: Int, end: Int, label: Int, ref: Int): Double

    Same as labelScore

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def canStartHere(begin: Int, end: Int, leftChild: Int): Boolean
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. val coarseLeftMostBeginForEnd: Array[Array[Int]]

    left most place a left constituent with label l can begin and end at position i (begin)(sym)

  9. val coarseLeftMostEndForBegin: Array[Array[Int]]

    left most place a right constituent with label l--which starts at position i--can end.

    left most place a right constituent with label l--which starts at position i--can end. (end)(sym)

  10. val coarseRightMostBeginForEnd: Array[Array[Int]]

    right most place a left constituent with label l can begin and end at position i.

    right most place a left constituent with label l can begin and end at position i. (begin)(sym)

  11. val coarseRightMostEndForBegin: Array[Array[Int]]

    right-most place a right constituent with label l--which starts at position i--can end.

    right-most place a right constituent with label l--which starts at position i--can end. (end)(sym)

  12. def decodedLabelScores(begin: Int, end: Int, label: Int): Counter[Int, Double]
  13. def decodedLabelScores(begin: Int, end: Int): Counter2[L, Int, Double]
  14. def enter(begin: Int, end: Int, parent: Int, ref: Int, w: Double): Unit
  15. def enteredLabelIndexes(begin: Int, end: Int): BitSet
  16. def enteredLabelRefinements(begin: Int, end: Int, label: Int): BitSet
  17. def enteredLabelScores(begin: Int, end: Int): Iterator[(L, Array[Double])]
  18. val enteredLabels: Array[BitSet]

    (begin,end) -> which labels are on

  19. val enteredRefinements: Array[Array[BitSet]]

    (begin,end) -> label -> which refinements of label are on

  20. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  22. def feasibleSplitPoints(begin: Int, end: Int, b: Int, refB: Int, c: Int, refC: Int): Span
  23. def feasibleSplitPoints(begin: Int, end: Int, b: Int, c: Int): Span
  24. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  25. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  26. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  27. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  28. def isLabelEntered(begin: Int, end: Int, l: Int): Boolean
  29. def labelScore(begin: Int, end: Int, parent: L, ref: Int): Double
    Annotations
    @inline()
  30. def labelScore(begin: Int, end: Int, label: Int, ref: Int): Double

    Returns the score of this (label,refinement) pair over the span (begin,end)

    Returns the score of this (label,refinement) pair over the span (begin,end)

    Annotations
    @inline()
  31. val leftMostBeginForEnd: Array[Array[Array[Int]]]

    left most place a constituent with label l can begin and end at position i, for left < i.

    left most place a constituent with label l can begin and end at position i, for left < i. (begin)(sym)(ref)

  32. val leftMostEndForBegin: Array[Array[Array[Int]]]

    left most place a constituent with label l--which starts at position i--can end.

    left most place a constituent with label l--which starts at position i--can end. (end)(sym)(ref)

  33. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. final def notify(): Unit
    Definition Classes
    AnyRef
  35. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  36. val rightMostBeginForEnd: Array[Array[Array[Int]]]

    right most place a constituent with label l can begin and end at position i, for right > i.

    right most place a constituent with label l can begin and end at position i, for right > i. (begin)(sym)(ref)

  37. val rightMostEndForBegin: Array[Array[Array[Int]]]

    right-most place a constituent with label l--which starts at position i--can end.

    right-most place a constituent with label l--which starts at position i--can end. (end)(sym)(ref)

  38. val score: TriangularArray[Array[Array[Double]]]

    (begin,end) -> label -> refinement -> score

  39. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  40. def toString(): String
    Definition Classes
    AnyRef → Any
  41. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped