Inference

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def forTesting: framework.Inference[TreeInstance[L, W]]

final def getClass(): Class[_]

def goldMarginal(scorer: Scorer, v: TreeInstance[L, W]): ParseMarginal[L, W]

Produces the "gold marginal" which is the marginal conditioned on the output label/structure itself.

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val labels: IndexedSeq[(L, Int)]

def marginal(anch: Scorer, v: TreeInstance[L, W]): ParseMarginal[L, W]

Produces the "guess marginal" which is the marginal conditioned on only the input data

def marginal(v: TreeInstance[L, W]): Marginal

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val pm: ParserInference[L, W]

def scorer(v: TreeInstance[L, W]): Scorer

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit