de.up.ling.irtg.automata

Class ConcreteTreeAutomaton<State>

java.lang.Object

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

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

Type Parameters:

State -

All Implemented Interfaces:

Intersectable<State>, Serializable

Direct Known Subclasses:

StringAlgebraSeed.OneSymbolAutomaton

public class ConcreteTreeAutomaton<State>
extends TreeAutomaton<State>

An automaton which can be constructed by explicitly adding rules, and which stores these rules explicitly in memory. The main added functionality of the automaton is given by the addRule and addFinalState methods.

Author:

koller

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
ConcreteTreeAutomaton() Constructs a new instance without any final states of rules.
ConcreteTreeAutomaton(Signature signature) Constructs a new instance without any final states or rules.
ConcreteTreeAutomaton(Signature signature, Interner<State> interner) Constructs a new instance without any final states or rules, which will use the given state interner to enumerate its states.

Method Summary

Modifier and Type	Method and Description
void	addFinalState(int state)
void	addRule(Rule rule) Adds the rule to the automaton.
int	addState(State state)
void	foreachRuleBottomUpForSets(IntSet labelIds, List<IntSet> childStateSets, SignatureMapper signatureMapper, Consumer<Rule> fn)
Iterable<Rule>	getRulesBottomUp(int label, int[] childStates) Finds automaton rules bottom-up for a given list of child states and a given parent label.
Iterable<Rule>	getRulesTopDown(int label, 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.

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, 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, toString, toStringBottomUp, useSiblingFinder, viterbi, viterbiRaw, write

Methods inherited from class java.lang.Object

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

Constructor Detail

ConcreteTreeAutomaton

public ConcreteTreeAutomaton()

Constructs a new instance without any final states of rules. This creates a new signature for the automaton.

ConcreteTreeAutomaton

public ConcreteTreeAutomaton(Signature signature)

Constructs a new instance without any final states or rules. This instance will use the given signature.

Parameters:

signature -

ConcreteTreeAutomaton

public ConcreteTreeAutomaton(Signature signature,
                             Interner<State> interner)

Constructs a new instance without any final states or rules, which will use the given state interner to enumerate its states. The signature used will be the one given. Only use this if you know what you're doing.

Parameters:

signature -

interner -

Method Detail

addState

public int addState(State state)

addFinalState

public void addFinalState(int state)

addRule

public void addRule(Rule rule)

Adds the rule to the automaton. The rule should be constructed with one of the createRule methods of the automaton to ensure that it is interpreted correctly.

Parameters:

rule -

getRulesBottomUp

public Iterable<Rule> getRulesBottomUp(int label,
                                       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 Iterable<Rule> getRulesTopDown(int label,
                                      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:

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:

foreachRuleBottomUpForSets

public void foreachRuleBottomUpForSets(IntSet labelIds,
                                       List<IntSet> childStateSets,
                                       SignatureMapper signatureMapper,
                                       Consumer<Rule> fn)

Overrides:

foreachRuleBottomUpForSets in class TreeAutomaton<State>