Package | Description |
---|---|
de.up.ling.irtg.automata.coarse_to_fine |
Classes used to implement coarse-to-fine parsing.
|
de.up.ling.irtg.automata.condensed |
Classes for "condensed" tree automata.
|
de.up.ling.irtg.automata.pruning |
This package implements beam search in the construction of a parse chart.
|
Modifier and Type | Method and Description |
---|---|
void |
CondensedCoarsestParser.parse(List<RuleRefinementNode> coarseNodes,
List<CondensedRule> partnerInvhomRules) |
Modifier and Type | Method and Description |
---|---|
CondensedRule |
CondensedTreeAutomaton.createRule(State parent,
List<String> labels,
List<State> children) |
CondensedRule |
CondensedTreeAutomaton.createRule(State parent,
List<String> labels,
List<State> children,
double weight) |
CondensedRule |
CondensedTreeAutomaton.createRule(State parent,
String[] labels,
State[] children) |
CondensedRule |
CondensedTreeAutomaton.createRule(State parent,
String[] labels,
State[] children,
double weight) |
CondensedRule |
CondensedTreeAutomaton.createRuleRaw(int parent,
int labelSetID,
int[] children,
double weight)
Creates a new Condensed Rule with parentState, labels and children
already resolved to int values.
|
Modifier and Type | Method and Description |
---|---|
Iterable<CondensedRule> |
CondensedRuleTrie.get(int[] childStates) |
Set<CondensedRule> |
CondensedRuleTrie.get(int[] childstates,
int labelSetID)
Returns a set of values, that is mapped to the final state
we reach with the sequence of transitions in childstates.
|
Iterable<CondensedRule> |
CondensedNondeletingInverseHomAutomaton.getCondensedRulesBottomUp(IntSet labelId,
int[] childStates) |
abstract Iterable<CondensedRule> |
CondensedTreeAutomaton.getCondensedRulesBottomUp(IntSet labelId,
int[] childStates) |
Iterable<CondensedRule> |
ConcreteCondensedTreeAutomaton.getCondensedRulesBottomUp(IntSet labelId,
int[] childStates) |
Iterable<CondensedRule> |
CondensedTreeAutomaton.getCondensedRulesBottomUpFromExplicit(int[] childStates) |
Iterable<CondensedRule> |
CondensedNondeletingInverseHomAutomaton.getCondensedRulesByParentState(int parentState)
This class should be used with this method for greatest efficency (eg in
IntersectionAutomaton).
|
Iterable<CondensedRule> |
CondensedTreeAutomaton.getCondensedRulesByParentState(int parentState)
Returns an Iterable over all CondensedRules that have a given
parentstate.
|
Set<CondensedRule> |
CondensedTreeAutomaton.getCondensedRuleSet()
Returns a set of all rules, that are part of this automaton.
|
Iterable<CondensedRule> |
CondensedTreeAutomaton.getCondensedRulesForRhsState(int rhsState) |
Set<CondensedRule> |
CondensedNondeletingInverseHomAutomaton.getCondensedRulesTopDown(IntSet labelId,
int parentState) |
abstract Iterable<CondensedRule> |
CondensedTreeAutomaton.getCondensedRulesTopDown(IntSet labelId,
int parentState) |
Set<CondensedRule> |
ConcreteCondensedTreeAutomaton.getCondensedRulesTopDown(IntSet labelId,
int parentState) |
Modifier and Type | Method and Description |
---|---|
void |
ConcreteCondensedTreeAutomaton.addRule(CondensedRule rule) |
void |
CondensedRuleTrie.put(int[] childstates,
int labelSetID,
CondensedRule rule)
Stores a sequence of ints (the Array) in the Trie
and maps the final state to the given rule.
|
Modifier and Type | Method and Description |
---|---|
void |
RulePairConsumer.accept(Rule left,
CondensedRule right,
double value) |
void |
StatewiseHistogramPruningPolicy.collect(int rightParent,
Rule left,
CondensedRule right) |
void |
HistogramPruningPolicy.collect(int rightParent,
Rule left,
CondensedRule right) |
void |
QuotientPruningPolicy.collect(int rightParent,
Rule left,
CondensedRule right) |
void |
PruningPolicy.collect(int rightParent,
Rule left,
CondensedRule right) |
void |
NoPruningPolicy.collect(int rightParent,
Rule left,
CondensedRule right) |
double |
SemiringFOM.evaluate(Rule left,
CondensedRule right) |
double |
FOM.evaluate(Rule left,
CondensedRule right) |
Copyright © 2017. All rights reserved.