Uses of Interface
de.up.ling.irtg.automata.Intersectable

Packages that use Intersectable

Package	Description
de.up.ling.irtg	This package contains the core classes for Alto, which represent Interpreted Regular tree grammars.
de.up.ling.irtg.algebra	Classes representing a number of useful algebras.
de.up.ling.irtg.algebra.graph	The algebra of s-graphs, together with supporting classes.
de.up.ling.irtg.automata	Classes for tree automata of various types.
de.up.ling.irtg.automata.condensed	Classes for "condensed" tree automata.
de.up.ling.irtg.binarization	Classes for binarizing IRTGs.
de.up.ling.irtg.siblingfinder	This contains class for sibling finder based intersection, which is used to speed up intersection.

Uses of Intersectable in de.up.ling.irtg

Methods in de.up.ling.irtg that return Intersectable

Modifier and Type	Method and Description
Intersectable	Interpretation.invhom(TreeAutomaton auto) Returns the image under inverse homomorphism of the given automaton.
Intersectable	Interpretation.parse(E object) This method takes the given object and attempts to compute its inverse homomorphism automaton.

Uses of Intersectable in de.up.ling.irtg.algebra

Classes in de.up.ling.irtg.algebra that implement Intersectable

Modifier and Type	Class and Description
class	TagStringAlgebra.TagDecompositionAutomaton An automaton that represents all possible terms in a given TAG algebra which evaluate to a fixed sequence of words.

Uses of Intersectable in de.up.ling.irtg.algebra.graph

Classes in de.up.ling.irtg.algebra.graph that implement Intersectable

Modifier and Type	Class and Description
class	SGraphBRDecompositionAutomatonBottomUp A bottom-up decomposition automaton for the s-graph algebra, using BoundaryRepresentations as states.
class	SGraphBRDecompositionAutomatonTopDown A top-down decomposition automaton for the s-graph algebra, using SComponentRepresentations as states.

Uses of Intersectable in de.up.ling.irtg.automata

Classes in de.up.ling.irtg.automata that implement Intersectable

Modifier and Type	Class and Description
class	BestFirstIntersectionAutomaton<LeftState,RightState> An intersection automaton for viterbi search that constructs transitions bottom up when makeAllRulesExplicit is called, according to a queue and stops construction once a complete tree can be derived.
class	ConcreteTreeAutomaton<State> An automaton which can be constructed by explicitly adding rules, and which stores these rules explicitly in memory.
class	IntersectionAutomaton<LeftState,RightState> This class is used to represent the intersection of two tree automata.
class	InverseHomAutomaton<State>
class	NondeletingInverseHomAutomaton<State> A tree automaton that describes the homomorphic pre-image of the language of another tree automaton.
class	SingletonAutomaton A tree automaton that accepts a single, given tree.
class	TreeAutomaton<State> A finite tree automaton.
class	UniversalAutomaton A tree automaton that accepts all terms over the given signature.

Methods in de.up.ling.irtg.automata with parameters of type Intersectable

Modifier and Type	Method and Description
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersect(Intersectable<OtherState> other) Intersects this automaton with another one.

Uses of Intersectable in de.up.ling.irtg.automata.condensed

Classes in de.up.ling.irtg.automata.condensed that implement Intersectable

Modifier and Type	Class and Description
class	ConcreteCondensedTreeAutomaton<State> This is an extension of CondensedTreeAutomaton for which all rules can and must be added externally and are then stored explicitly for quick access.
class	CondensedBottomUpIntersectionAutomaton<LeftState,RightState> This automaton represents the intersection of two tree automaton, at least one of which is a condensed tree automaton.
class	CondensedIntersectionAutomaton<LeftState,RightState> Intersecting two automatons using a CKY-algorithm.
class	CondensedNondeletingInverseHomAutomaton<State> A tree automaton that describes the homomorphic pre-image of the language of another tree automaton.
class	CondensedTreeAutomaton<State>
class	CondensedViterbiIntersectionAutomaton<LeftState,RightState> Intersecting two automatons, but saving only the one best path.
class	GenericCondensedIntersectionAutomaton<LeftState,RightState> Computes an automaton for the intersection of an ordinary TreeAutomaton (left) and a CondensedTreeAutomaton (right).
class	NonCondensedIntersectionAutomaton<LeftState,RightState> A variant of GenericCondensedIntersectionAutomaton that expands each condensed rule into the individual ordinary rules it represents.

Uses of Intersectable in de.up.ling.irtg.binarization

Classes in de.up.ling.irtg.binarization that implement Intersectable

Modifier and Type	Class and Description
static class	StringAlgebraSeed.OneSymbolAutomaton

Uses of Intersectable in de.up.ling.irtg.siblingfinder

Classes in de.up.ling.irtg.siblingfinder that implement Intersectable

Modifier and Type	Class and Description
class	SiblingFinderInvhom<State>