de.up.ling.irtg.automata.condensed

Class CondensedBottomUpIntersectionAutomaton<LeftState,RightState>

java.lang.Object

de.up.ling.irtg.automata.TreeAutomaton<Pair<LeftState,RightState>>

de.up.ling.irtg.automata.condensed.CondensedBottomUpIntersectionAutomaton<LeftState,RightState>

Type Parameters:

LeftState -

RightState -

All Implemented Interfaces:

Intersectable<Pair<LeftState,RightState>>, Serializable

public class CondensedBottomUpIntersectionAutomaton<LeftState,RightState>
extends TreeAutomaton<Pair<LeftState,RightState>>

This automaton represents the intersection of two tree automaton, at least one of which is a condensed tree automaton. Before the automaton returns any rules it will always make all it's rules explicit. This is done through a bottom up search of rules, by attempting to combine states it has already discovered. Note that the automaton itself is not condensed.

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
CondensedBottomUpIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper)

Method Summary

Modifier and Type	Method and Description
IntSet	getFinalStates() Returns the IDs of the final states of the automaton.
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.
boolean	isBottomUpDeterministic() Determines whether the automaton is deterministic if read as a bottom-up automaton.
static void	main(String[] args)
void	makeAllRulesExplicit() Computes all rules in this automaton and stores them in the cache.

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

CondensedBottomUpIntersectionAutomaton

public CondensedBottomUpIntersectionAutomaton(TreeAutomaton<LeftState> left,
                                              CondensedTreeAutomaton<RightState> right,
                                              SignatureMapper sigMapper)

Parameters:

left -

right -

sigMapper -

Method Detail

makeAllRulesExplicit

public void makeAllRulesExplicit()

Description copied from class: TreeAutomaton

Computes all rules in this automaton and stores them in the cache. This only makes a difference for lazy automata, in which rules are only computed by need. After calling this function, it is guaranteed that all rules are in the cache.

Overrides:

makeAllRulesExplicit in class TreeAutomaton<Pair<LeftState,RightState>>

getFinalStates

public IntSet getFinalStates()

Description copied from class: TreeAutomaton

Returns the IDs of the final states of the automaton.

Overrides:

getFinalStates in class TreeAutomaton<Pair<LeftState,RightState>>

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<Pair<LeftState,RightState>>

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<Pair<LeftState,RightState>>

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<Pair<LeftState,RightState>>

Returns:

main

public static void main(String[] args)
                 throws Exception

Throws:

Exception