Class WeightedRegularTreeGrammar<E extends GraphBasedNonterminal,T extends Comparable<T>>
java.lang.Object
de.saar.chorus.domgraph.chart.RegularTreeGrammar<E>
de.saar.chorus.domgraph.chart.ConcreteRegularTreeGrammar<E>
de.saar.chorus.domgraph.chart.wrtg.WeightedRegularTreeGrammar<E,T>
- All Implemented Interfaces:
Cloneable
public class WeightedRegularTreeGrammar<E extends GraphBasedNonterminal,T extends Comparable<T>>
extends ConcreteRegularTreeGrammar<E>
-
Field Summary
Fields inherited from class de.saar.chorus.domgraph.chart.ConcreteRegularTreeGrammar
chart, finalStates, refcount, singletons, size, toplevelSubgraphsFields inherited from class de.saar.chorus.domgraph.chart.RegularTreeGrammar
numSolvedForms -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoidbooleanaddWeightedDomEdge(String src, String tgt, T weight) getWeightForSplit(Split<E> split) booleansetWeightForSplit(Split<E> s, T weight) TODO what to do if this split has a weight already?Methods inherited from class de.saar.chorus.domgraph.chart.ConcreteRegularTreeGrammar
addSplit, addToplevelSubgraph, cleanup, clear, clone, containsSplitFor, countSubgraphs, deleteSubgraph, getAllNonterminals, getLabelForSplit, getRootForSingleton, getSplitsFor, getSplitsFor, getToplevelSubgraphs, isFinal, isSingleton, makeExplicit, recomputeSingletons, reduce, setFinal, setSplitsForSubgraph, sizeMethods inherited from class de.saar.chorus.domgraph.chart.RegularTreeGrammar
countSolvedForms, countSolvedFormsFor, intersect, toString
-
Constructor Details
-
WeightedRegularTreeGrammar
-
-
Method Details
-
setWeightForSplit
TODO what to do if this split has a weight already?- Parameters:
s-weight-- Returns:
-
getWeightForSplit
-
getSemiring
-
addSplit
-
getAllSplits
-
addWeightedDomEdge
-