LexModel

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def accumulateCounts(inf: Inference, s: Scorer, d: TreeInstance[L, W], m: Marginal, accum: ExpectedCounts, scale: Double): Unit

final def accumulateCounts(inf: Inference, d: TreeInstance[L, W], accum: ExpectedCounts, scale: Double): Unit

final def asInstanceOf[T0]: T0

def cacheFeatureWeights(weights: DenseVector[Double], suffix: String = ""): Unit

Caches the weights using the cache broker.

def clone(): AnyRef

val constrainer: Factory[L, W]

def emptyCounts: StandardExpectedCounts[Feature]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def expectedCounts(inf: Inference, d: TreeInstance[L, W], scale: Double = 1.0): ExpectedCounts

def expectedCountsToObjective(ecounts: ExpectedCounts): (Double, DenseVector[Double])

def extractParser(weights: DenseVector[Double])(implicit deb: Debinarizer[L]): Parser[L, W]

val featureIndex: SegmentedIndex[Feature, CrossProductIndex[Feature, Feature]]

Models have features, and this defines the mapping from indices in the weight vector to features.

final def getClass(): Class[_]

def hashCode(): Int

def inferenceFromWeights(weights: DenseVector[Double]): AnnotatedParserInference[L, W]

def initialValueForFeature(f: Feature): Double

final def isInstanceOf[T0]: Boolean

def lexicon: Lexicon[L, W]

def logger: LazyLogger

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def numFeatures: Int

def readCachedFeatureWeights(suffix: String = ""): Option[DenseVector[Double]]

just saves feature weights to disk as a serialized counter.

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

def toString(): String

def topology: RuleTopology[L]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def weightsCacheName: String

def finalize(): Unit