SimpleGrammar

final def !=(arg0: Any): Boolean

final def ##(): Int

def *(refined: Grammar[L, W]): Grammar[L, W]

final def ==(arg0: Any): Boolean

def anchor(w: IndexedSeq[W], constr: ChartConstraints[L]): Anchoring[L, L2, W]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

def index: Index[Rule[L]]

val insideTensor: SparseRuleTensor[L2]

final def isInstanceOf[T0]: Boolean

def labelEncoder: Encoder[L]

def labelIndex: Index[L]

val lexicon: Lexicon[L, W]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val outsideTensor: SparseRuleTensor[L2]

Swaps left child and parent

def prettyPrint(out: Writer = new PrintWriter(System.out)): Unit

Writes a text representation of the grammar to the output.

val refinedTopology: RuleTopology[L2]

val refinements: GrammarRefinements[L, L2]

def root: L

def ruleScore(refinedRule: Int): Double

def ruleScore(r: Int, ruleRef: Int): Double

val ruleScoreArray: Array[Double]

def signature: String

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

val tagScorer: TagScorer[L2, W]

def toString(): String

val topology: RuleTopology[L]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def withPermissiveLexicon: Grammar[L, W]

def finalize(): Unit