de.up.ling.irtg.algebra.graph

Class SGraphBRDecompositionAutomatonTopDown

java.lang.Object

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

de.up.ling.irtg.algebra.graph.SGraphBRDecompositionAutomatonTopDown

All Implemented Interfaces:

Intersectable<SComponentRepresentation>, Serializable

public class SGraphBRDecompositionAutomatonTopDown
extends TreeAutomaton<SComponentRepresentation>

A top-down decomposition automaton for the s-graph algebra, using SComponentRepresentations as states.

Author:

grpschwitz

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
SGraphBRDecompositionAutomatonTopDown(SGraph completeGraph, GraphAlgebra algebra) Initializes a decomposition automaton for completeGraph with respect to algebra.

Method Summary

Modifier and Type	Method and Description
Iterable<Rule>	getRulesBottomUp(int labelId, int[] childStates) Finds automaton rules bottom-up for a given list of child states and a given parent label.
Iterable<Rule>	getRulesTopDown(int labelId, int parentState) Finds automaton rules top-down for a given parent state and label.
Set<SComponentRepresentation>	getStoredConstantsForID(int labelID) If this automaton has stored states for all the constants in its signature, more precisely if hasStoredConstants() returns true, then this returns the states corresponding to the constant described by the label ID in the signature.
boolean	isBottomUpDeterministic() Determines whether the automaton is deterministic if read as a bottom-up automaton.
boolean	supportsBottomUpQueries()
boolean	supportsTopDownQueries()

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

Methods inherited from class java.lang.Object

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

Constructor Detail

SGraphBRDecompositionAutomatonTopDown

public SGraphBRDecompositionAutomatonTopDown(SGraph completeGraph,
                                             GraphAlgebra algebra)

Initializes a decomposition automaton for completeGraph with respect to algebra.

Parameters:

completeGraph -

algebra -

Method Detail

getStoredConstantsForID

public Set<SComponentRepresentation> getStoredConstantsForID(int labelID)

Description copied from class: TreeAutomaton

If this automaton has stored states for all the constants in its signature, more precisely if hasStoredConstants() returns true, then this returns the states corresponding to the constant described by the label ID in the signature.

Overrides:

getStoredConstantsForID in class TreeAutomaton<SComponentRepresentation>

Returns:

getRulesTopDown

public Iterable<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<SComponentRepresentation>

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<SComponentRepresentation>

Returns:

getRulesBottomUp

public Iterable<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<SComponentRepresentation>

Returns:

supportsBottomUpQueries

public boolean supportsBottomUpQueries()

Overrides:

supportsBottomUpQueries in class TreeAutomaton<SComponentRepresentation>

supportsTopDownQueries

public boolean supportsTopDownQueries()

Overrides:

supportsTopDownQueries in class TreeAutomaton<SComponentRepresentation>