de.up.ling.irtg.automata.condensed

Class CondensedTreeAutomaton<State>

java.lang.Object

de.up.ling.irtg.automata.TreeAutomaton<State>

de.up.ling.irtg.automata.condensed.CondensedTreeAutomaton<State>

All Implemented Interfaces:

Intersectable<State>, Serializable

Direct Known Subclasses:

ConcreteCondensedTreeAutomaton, CondensedNondeletingInverseHomAutomaton

public abstract class CondensedTreeAutomaton<State>
extends TreeAutomaton<State>

Author:

gontrum

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class de.up.ling.irtg.automata.TreeAutomaton

TreeAutomaton.BottomUpStateVisitor

Field Summary

Fields inherited from class de.up.ling.irtg.automata.TreeAutomaton

D, DEBUG_STORE

Constructor Summary

Constructors

Constructor and Description
CondensedTreeAutomaton(Signature signature)

Method Summary

Modifier and Type	Method and Description
int	addLabelSetID(IntSet labels)
int	addLabelSetID(String[] labels, int arity)
int	addState(State state)
CondensedRule	createRule(State parent, List<String> labels, List<State> children)
CondensedRule	createRule(State parent, List<String> labels, List<State> children, double weight)
CondensedRule	createRule(State parent, String[] labels, State[] children)
CondensedRule	createRule(State parent, String[] labels, State[] children, double weight)
CondensedRule	createRuleRaw(int parent, int labelSetID, int[] children, double weight) Creates a new Condensed Rule with parentState, labels and children already resolved to int values.
abstract Iterable<CondensedRule>	getCondensedRulesBottomUp(IntSet labelId, int[] childStates)
Iterable<CondensedRule>	getCondensedRulesBottomUpFromExplicit(int[] childStates)
Iterable<CondensedRule>	getCondensedRulesByParentState(int parentState) Returns an Iterable over all CondensedRules that have a given parentstate.
Set<CondensedRule>	getCondensedRuleSet() Returns a set of all rules, that are part of this automaton.
Iterable<CondensedRule>	getCondensedRulesForRhsState(int rhsState)
abstract Iterable<CondensedRule>	getCondensedRulesTopDown(IntSet labelId, int parentState)
IntSet	getLabelsForID(int labelSetID)
Set<Rule>	getRulesBottomUp(int labelId, int[] childStates) Finds automaton rules bottom-up for a given list of child states and a given parent label.
Set<Rule>	getRulesTopDown(int labelId, int parentState) Finds automaton rules top-down for a given parent state and label.
boolean	isBottomUpDeterministic() Determines whether the automaton is deterministic if read as a bottom-up automaton.
abstract void	makeAllRulesCondensedExplicit() Stores all information about CondensedRules in the ruleTrie and topDownRules structures.
String	toString() Returns a graphic representation of this Automaton that shows the actual CondensedRules
String	toStringFull() Returns a string representation of this condensed automaton with all the individual rules spelled out.

Methods inherited from class de.up.ling.irtg.automata.TreeAutomaton

accepts, acceptsRaw, analyze, asConcreteTreeAutomaton, asConcreteTreeAutomatonBottomUp, asConcreteTreeAutomatonWithStringStates, countTrees, createRule, createRule, createRule, createRule, createRule, createRule, determinize, determinize, dumpToFile, equals, evaluateInSemiring, evaluateInSemiring, evaluateInSemiringTopDown, foreachRuleBottomUpForSets, foreachRuleTopDown, foreachStateInBottomUpOrder, getAllLabels, getAllRulesTopDown, getAllStates, getFinalStates, getIdForState, getLabelsTopDown, getNumberOfRules, getNumberOfSeenStates, getRandomRuleTree, getRandomRuleTreeFromInside, getRandomTree, getRandomTreeFromInside, getReachableStates, getRulesBottomUp, getRulesBottomUp, getRuleSet, getRulesForRhsState, getRulesTopDown, getRuleTree, getSignature, getStateForId, getStateInterner, getStatesInBottomUpOrder, getStoredConstantsForID, getWeight, getWeightRaw, hasRuleWithPrefix, hasStoredConstants, homomorphism, inside, intersect, intersect, intersectBottomUp, intersectCondensed, intersectCondensed, intersectCondensed, intersectCondensedBottomUp, intersectCondensedBottomUp, intersectEarley, intersectViterbi, intersectViterbi, inverseCondensedHomomorphism, inverseHomomorphism, isCyclic, isEmpty, isStoring, language, languageIterable, languageIterator, languageIteratorRaw, languageRaw, makeAllRulesExplicit, newSiblingFinder, normalizeRuleWeights, outside, processAllRulesBottomUp, processAllRulesTopDown, reduceTopDown, run, run, runRaw, setRulePrintingFilter, setSkipFail, setStoring, sortedLanguageIterator, supportsBottomUpQueries, supportsTopDownQueries, toStringBottomUp, useSiblingFinder, viterbi, viterbiRaw, write

Methods inherited from class java.lang.Object

getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

CondensedTreeAutomaton

public CondensedTreeAutomaton(Signature signature)

Method Detail

createRule

public CondensedRule createRule(State parent,
                                List<String> labels,
                                List<State> children)

createRule

public CondensedRule createRule(State parent,
                                List<String> labels,
                                List<State> children,
                                double weight)

createRule

public CondensedRule createRule(State parent,
                                String[] labels,
                                State[] children)

createRule

public CondensedRule createRule(State parent,
                                String[] labels,
                                State[] children,
                                double weight)

createRuleRaw

public CondensedRule createRuleRaw(int parent,
                                   int labelSetID,
                                   int[] children,
                                   double weight)

Creates a new Condensed Rule with parentState, labels and children already resolved to int values.

Parameters:

parent -

labelSetID -

children -

weight -

Returns:

addLabelSetID

public int addLabelSetID(String[] labels,
                         int arity)

addLabelSetID

public int addLabelSetID(IntSet labels)

getLabelsForID

public IntSet getLabelsForID(int labelSetID)

addState

public int addState(State state)

getCondensedRulesBottomUp

public abstract Iterable<CondensedRule> getCondensedRulesBottomUp(IntSet labelId,
                                                                  int[] childStates)

getCondensedRulesTopDown

public abstract Iterable<CondensedRule> getCondensedRulesTopDown(IntSet labelId,
                                                                 int parentState)

getCondensedRulesBottomUpFromExplicit

public Iterable<CondensedRule> getCondensedRulesBottomUpFromExplicit(int[] childStates)

getCondensedRulesForRhsState

public Iterable<CondensedRule> getCondensedRulesForRhsState(int rhsState)

isBottomUpDeterministic

public boolean isBottomUpDeterministic()

Description copied from class: TreeAutomaton

Determines whether the automaton is deterministic if read as a bottom-up automaton.

Specified by:

isBottomUpDeterministic in class TreeAutomaton<State>

Returns:

getRulesBottomUp

public Set<Rule> getRulesBottomUp(int labelId,
                                  int[] childStates)

Description copied from class: TreeAutomaton

Finds automaton rules bottom-up for a given list of child states and a given parent label. The method returns a collection of rules that can be used to assign a state to the parent node. The parent label is a numeric symbol ID, which represents a terminal symbol according to the automaton's signature.

Specified by:

getRulesBottomUp in class TreeAutomaton<State>

Returns:

getRulesTopDown

public Set<Rule> getRulesTopDown(int labelId,
                                 int parentState)

Description copied from class: TreeAutomaton

Finds automaton rules top-down for a given parent state and label. The method returns a collection of rules that can be used to assign states to the children. The parent label is a numeric symbol ID, which represents a terminal symbol according to the automaton's signature.

Note that not every method of TreeAutomaton is safely available in your implementation of getRulesTopDown. Most notably, you can't use the default implementation of TreeAutomaton.getAllStates(), because that method makes all rules of the automaton explicit and calls TreeAutomaton.getRulesTopDown(int, int) in the process, leading to an infinite recursion.

Specified by:

getRulesTopDown in class TreeAutomaton<State>

Returns:

getCondensedRulesByParentState

public Iterable<CondensedRule> getCondensedRulesByParentState(int parentState)

Returns an Iterable over all CondensedRules that have a given parentstate.

Parameters:

parentState -

Returns:

getCondensedRuleSet

public Set<CondensedRule> getCondensedRuleSet()

Returns a set of all rules, that are part of this automaton.

Returns:

toStringFull

public String toStringFull()

Returns a string representation of this condensed automaton with all the individual rules spelled out.

toString

public String toString()

Returns a graphic representation of this Automaton that shows the actual CondensedRules

Overrides:

toString in class TreeAutomaton<State>

Returns:

makeAllRulesCondensedExplicit

public abstract void makeAllRulesCondensedExplicit()

Stores all information about CondensedRules in the ruleTrie and topDownRules structures. Should only be executed if the isCondensedExplicit variable is set false.