class SimpleGrammar[L, L2, W] extends Grammar[L, W] with Serializable
A epic.parser.SimpleGrammar is a grammar where the topology of the grammar (including the refinements) and the scores for the rules does not vary with the input sentence. That is, this is the class for the standard kind of PCFG/WCFG that are normally taught.
- Annotations
- @SerialVersionUID()
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- SimpleGrammar
- Grammar
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new SimpleGrammar(topology: RuleTopology[L], lexicon: Lexicon[L, W], refinements: GrammarRefinements[L, L2], refinedTopology: RuleTopology[L2], ruleScoreArray: Array[Double], tagScorer: TagScorer[L2, W])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
*(refined: Grammar[L, W]): Grammar[L, W]
- Definition Classes
- Grammar
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
anchor(w: IndexedSeq[W], constr: ChartConstraints[L]): Anchoring[L, L2, W]
- Definition Classes
- SimpleGrammar → Grammar
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
def
index: Index[Rule[L]]
- Definition Classes
- Grammar
- val insideTensor: SparseRuleTensor[L2]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
labelEncoder: Encoder[L]
- Definition Classes
- Grammar
-
def
labelIndex: Index[L]
- Definition Classes
- Grammar
-
val
lexicon: Lexicon[L, W]
- Definition Classes
- SimpleGrammar → Grammar
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
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
- Definition Classes
- Grammar
- 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
- Definition Classes
- AnyRef
- val tagScorer: TagScorer[L2, W]
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
val
topology: RuleTopology[L]
- Definition Classes
- SimpleGrammar → Grammar
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
withPermissiveLexicon: Grammar[L, W]
- Definition Classes
- SimpleGrammar → Grammar