edu.stanford.nlp.parser.lexparser
Class GrammarCompactor
java.lang.Object
edu.stanford.nlp.parser.lexparser.GrammarCompactor
- Direct Known Subclasses:
- ExactGrammarCompactor
public abstract class GrammarCompactor
- extends java.lang.Object
- Author:
- Teg Grenager (grenager@cs.stanford.edu)
Method Summary |
protected boolean |
addOneBinaryRule(BinaryRule rule,
java.util.Map<java.lang.String,TransducerGraph> graphs)
|
protected boolean |
addOneUnaryRule(UnaryRule rule,
java.util.Map<java.lang.String,TransducerGraph> graphs)
|
Pair<UnaryGrammar,BinaryGrammar> |
compactGrammar(Pair<UnaryGrammar,BinaryGrammar> grammar)
|
Pair<UnaryGrammar,BinaryGrammar> |
compactGrammar(Pair<UnaryGrammar,BinaryGrammar> grammar,
java.util.Map<java.lang.String,java.util.List<java.util.List<java.lang.String>>> allTrainPaths,
java.util.Map<java.lang.String,java.util.List<java.util.List<java.lang.String>>> allTestPaths)
Compacts the grammar specified by the Pair. |
protected Distribution<java.lang.String> |
computeInputPrior(java.util.Map<java.lang.String,java.util.List<java.util.List<java.lang.String>>> allTrainPaths)
|
java.util.Map<java.lang.String,TransducerGraph> |
convertGrammarToGraphs(Pair<UnaryGrammar,BinaryGrammar> grammar,
java.util.Set<UnaryRule> unaryRules,
java.util.Set<BinaryRule> binaryRules)
|
Pair<UnaryGrammar,BinaryGrammar> |
convertGraphsToGrammar(java.util.Set<TransducerGraph> graphs,
java.util.Set<UnaryRule> unaryRules,
java.util.Set<BinaryRule> binaryRules)
|
protected abstract TransducerGraph |
doCompaction(TransducerGraph graph,
java.util.List<java.util.List<java.lang.String>> trainPaths,
java.util.List<java.util.List<java.lang.String>> testPaths)
|
protected TransducerGraph |
getGraphFromMap(java.util.Map<java.lang.String,TransducerGraph> m,
java.lang.String o)
|
protected java.lang.String |
getTopCategoryOfSyntheticState(java.lang.String s)
|
protected boolean |
isSyntheticState(java.lang.String state)
|
static boolean |
writeFile(TransducerGraph graph,
java.lang.String dir,
java.lang.String name)
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
RAW_COUNTS
public static final java.lang.Object RAW_COUNTS
NORMALIZED_LOG_PROBABILITIES
public static final java.lang.Object NORMALIZED_LOG_PROBABILITIES
outputType
public java.lang.Object outputType
stateNumberer
protected Numberer stateNumberer
newStateNumberer
protected Numberer newStateNumberer
stateSpace
protected java.lang.String stateSpace
inputPrior
protected Distribution<java.lang.String> inputPrior
verbose
protected boolean verbose
GrammarCompactor
public GrammarCompactor()
doCompaction
protected abstract TransducerGraph doCompaction(TransducerGraph graph,
java.util.List<java.util.List<java.lang.String>> trainPaths,
java.util.List<java.util.List<java.lang.String>> testPaths)
compactGrammar
public Pair<UnaryGrammar,BinaryGrammar> compactGrammar(Pair<UnaryGrammar,BinaryGrammar> grammar)
compactGrammar
public Pair<UnaryGrammar,BinaryGrammar> compactGrammar(Pair<UnaryGrammar,BinaryGrammar> grammar,
java.util.Map<java.lang.String,java.util.List<java.util.List<java.lang.String>>> allTrainPaths,
java.util.Map<java.lang.String,java.util.List<java.util.List<java.lang.String>>> allTestPaths)
- Compacts the grammar specified by the Pair.
- Parameters:
grammar
- a Pair of grammars, ordered UnaryGrammar BinaryGrammar.allTrainPaths
- a Map from String passive constituents to Lists of pathsallTestPaths
- a Map from String passive constituents to Lists of paths
- Returns:
- a Pair of grammars, ordered UnaryGrammar BinaryGrammar.
computeInputPrior
protected Distribution<java.lang.String> computeInputPrior(java.util.Map<java.lang.String,java.util.List<java.util.List<java.lang.String>>> allTrainPaths)
writeFile
public static boolean writeFile(TransducerGraph graph,
java.lang.String dir,
java.lang.String name)
convertGrammarToGraphs
public java.util.Map<java.lang.String,TransducerGraph> convertGrammarToGraphs(Pair<UnaryGrammar,BinaryGrammar> grammar,
java.util.Set<UnaryRule> unaryRules,
java.util.Set<BinaryRule> binaryRules)
getGraphFromMap
protected TransducerGraph getGraphFromMap(java.util.Map<java.lang.String,TransducerGraph> m,
java.lang.String o)
getTopCategoryOfSyntheticState
protected java.lang.String getTopCategoryOfSyntheticState(java.lang.String s)
addOneUnaryRule
protected boolean addOneUnaryRule(UnaryRule rule,
java.util.Map<java.lang.String,TransducerGraph> graphs)
addOneBinaryRule
protected boolean addOneBinaryRule(BinaryRule rule,
java.util.Map<java.lang.String,TransducerGraph> graphs)
isSyntheticState
protected boolean isSyntheticState(java.lang.String state)
convertGraphsToGrammar
public Pair<UnaryGrammar,BinaryGrammar> convertGraphsToGrammar(java.util.Set<TransducerGraph> graphs,
java.util.Set<UnaryRule> unaryRules,
java.util.Set<BinaryRule> binaryRules)
- Parameters:
graphs
- a Map from String categories to TransducerGraph objectsunaryRules
- is a Set of UnaryRule objects that we need to addbinaryRules
- is a Set of BinaryRule objects that we need to add
- Returns:
- a new Pair of UnaryGrammar, BinaryGrammar
Stanford NLP Group