public abstract class GrammarCompactor
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
protected Distribution<java.lang.String> |
inputPrior |
protected Index<java.lang.String> |
newStateIndex |
static java.lang.Object |
NORMALIZED_LOG_PROBABILITIES |
protected Options |
op |
java.lang.Object |
outputType |
static java.lang.Object |
RAW_COUNTS |
protected Index<java.lang.String> |
stateIndex |
protected boolean |
verbose |
Constructor and Description |
---|
GrammarCompactor(Options op) |
Modifier and Type | Method and Description |
---|---|
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) |
Triple<Index<java.lang.String>,UnaryGrammar,BinaryGrammar> |
compactGrammar(Pair<UnaryGrammar,BinaryGrammar> grammar,
Index<java.lang.String> originalStateIndex) |
Triple<Index<java.lang.String>,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,
Index<java.lang.String> originalStateIndex)
Compacts the grammar specified by the Pair.
|
protected static Distribution<java.lang.String> |
computeInputPrior(java.util.Map<java.lang.String,java.util.List<java.util.List<java.lang.String>>> allTrainPaths) |
protected java.util.Map<java.lang.String,TransducerGraph> |
convertGrammarToGraphs(Pair<UnaryGrammar,BinaryGrammar> grammar,
java.util.Set<UnaryRule> unaryRules,
java.util.Set<BinaryRule> binaryRules) |
protected 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 static TransducerGraph |
getGraphFromMap(java.util.Map<java.lang.String,TransducerGraph> m,
java.lang.String o) |
protected static java.lang.String |
getTopCategoryOfSyntheticState(java.lang.String s) |
protected static boolean |
isSyntheticState(java.lang.String state) |
static boolean |
writeFile(TransducerGraph graph,
java.lang.String dir,
java.lang.String name) |
public static final java.lang.Object RAW_COUNTS
public static final java.lang.Object NORMALIZED_LOG_PROBABILITIES
public java.lang.Object outputType
protected Index<java.lang.String> stateIndex
protected Index<java.lang.String> newStateIndex
protected Distribution<java.lang.String> inputPrior
protected boolean verbose
protected final Options op
public GrammarCompactor(Options op)
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)
public Triple<Index<java.lang.String>,UnaryGrammar,BinaryGrammar> compactGrammar(Pair<UnaryGrammar,BinaryGrammar> grammar, Index<java.lang.String> originalStateIndex)
public Triple<Index<java.lang.String>,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, Index<java.lang.String> originalStateIndex)
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 pathsprotected static Distribution<java.lang.String> computeInputPrior(java.util.Map<java.lang.String,java.util.List<java.util.List<java.lang.String>>> allTrainPaths)
public static boolean writeFile(TransducerGraph graph, java.lang.String dir, java.lang.String name)
protected java.util.Map<java.lang.String,TransducerGraph> convertGrammarToGraphs(Pair<UnaryGrammar,BinaryGrammar> grammar, java.util.Set<UnaryRule> unaryRules, java.util.Set<BinaryRule> binaryRules)
protected static TransducerGraph getGraphFromMap(java.util.Map<java.lang.String,TransducerGraph> m, java.lang.String o)
protected static java.lang.String getTopCategoryOfSyntheticState(java.lang.String s)
protected boolean addOneUnaryRule(UnaryRule rule, java.util.Map<java.lang.String,TransducerGraph> graphs)
protected boolean addOneBinaryRule(BinaryRule rule, java.util.Map<java.lang.String,TransducerGraph> graphs)
protected static boolean isSyntheticState(java.lang.String state)
protected Pair<UnaryGrammar,BinaryGrammar> convertGraphsToGrammar(java.util.Set<TransducerGraph> graphs, java.util.Set<UnaryRule> unaryRules, java.util.Set<BinaryRule> binaryRules)
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