de.up.ling.irtg.automata

Class NondeletingInverseHomAutomaton<State>

java.lang.Object

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

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

All Implemented Interfaces:

Intersectable<Object>, Serializable

public class NondeletingInverseHomAutomaton<State>
extends TreeAutomaton<Object>

A tree automaton that describes the homomorphic pre-image of the language of another tree automaton. This class only functions correctly if the homomorphism is non-deleting. This automaton has the same states as the base automaton, converted into strings.

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
NondeletingInverseHomAutomaton(TreeAutomaton<State> rhsAutomaton, Homomorphism hom)

Method Summary

Modifier and Type	Method and Description
IntSet	getAllStates() Returns the IDs of all states in this automaton.
IntSet	getFinalStates() Returns the IDs of the final states of the automaton.
Iterable<Rule>	getRulesBottomUp(int label, int[] childStates) Finds automaton rules bottom-up for a given list of child states and a given parent label.
Set<Rule>	getRulesBottomUpFromExplicitWithTermID(int termID, int[] childStates)
Set<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.
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, 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, toString, toStringBottomUp, useSiblingFinder, viterbi, viterbiRaw, write

Methods inherited from class java.lang.Object

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

Constructor Detail

NondeletingInverseHomAutomaton

public NondeletingInverseHomAutomaton(TreeAutomaton<State> rhsAutomaton,
                                      Homomorphism hom)

Method Detail

getFinalStates

public IntSet getFinalStates()

Description copied from class: TreeAutomaton

Returns the IDs of the final states of the automaton.

Overrides:

getFinalStates in class TreeAutomaton<Object>

Returns:

getAllStates

public IntSet getAllStates()

Description copied from class: TreeAutomaton

Returns the IDs of all states in this automaton. If the automaton is a lazy implementation, it is required to make all rules explicit before returning, to the extent that it is necessary to list all states. This may be slow.

Overrides:

getAllStates in class TreeAutomaton<Object>

Returns:

getRulesBottomUpFromExplicitWithTermID

public Set<Rule> getRulesBottomUpFromExplicitWithTermID(int termID,
                                                        int[] childStates)

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

Returns:

supportsBottomUpQueries

public boolean supportsBottomUpQueries()

Overrides:

supportsBottomUpQueries in class TreeAutomaton<Object>

getRulesTopDown

public Set<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<Object>

Returns:

supportsTopDownQueries

public boolean supportsTopDownQueries()

Overrides:

supportsTopDownQueries in class TreeAutomaton<Object>

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

Returns: