Uses of Class
de.up.ling.irtg.automata.TreeAutomaton

Packages that use TreeAutomaton

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.coarse_to_fine	Classes used to implement coarse-to-fine parsing.
de.up.ling.irtg.automata.condensed	Classes for "condensed" tree automata.
de.up.ling.irtg.automata.index	Index data structures for tree automata.
de.up.ling.irtg.automata.language_iteration	This package implements Alto's functionality for iterating over the language of a tree automaton in best first order.
de.up.ling.irtg.binarization	Classes for binarizing IRTGs.
de.up.ling.irtg.codec	Classes for reading and writing IRTGs, tree automata, and other objects.
de.up.ling.irtg.corpus	Classes for working with corpora.
de.up.ling.irtg.gui	A graphical user interface (GUI) for Alto.
de.up.ling.irtg.maxent	Classes for working with maximum-entropy IRTGs.
de.up.ling.irtg.random_automata	This package contains code to generate random tree automata for evaluation purposes.
de.up.ling.irtg.sampling	This package contains tools to implement approximate inference via sampling.
de.up.ling.irtg.sampling.rule_weighting	This package contains automata with adaptable sampling heuristics.
de.up.ling.irtg.script	Various useful scripts.
de.up.ling.irtg.siblingfinder	This contains class for sibling finder based intersection, which is used to speed up intersection.
de.up.ling.irtg.util	Various utilities.

Uses of TreeAutomaton in de.up.ling.irtg

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

Modifier and Type	Method and Description
TreeAutomaton	Interpretation.basicNonDelInvHom(TreeAutomaton auto) This returns an inverse homomorphism automaton with the added assumption that the underlying homomorphism is non-deleting.
TreeAutomaton	InterpretedTreeAutomaton.decodeToAutomaton(String outputInterpretation, TreeAutomaton parseChart) Decodes a parse chart to a term chart over some output algebra.
TreeAutomaton<String>	InterpretedTreeAutomaton.getAutomaton() Returns the derivation tree automaton.
TreeAutomaton	InterpretedTreeAutomaton.parse(Map<String,String> representations) Parses a map of input representations to a parse chart.
TreeAutomaton	InterpretedTreeAutomaton.parseCondensedWithPruning(Map<String,Object> inputs, PruningPolicy pp)
TreeAutomaton	InterpretedTreeAutomaton.parseInputObjects(Map<String,Object> inputs) Parses a map of input objects to a parse chart.
TreeAutomaton	InterpretedTreeAutomaton.parseSimple(String interpretationName, Object input) Parses a single input representations to a parse chart without using any optimization in the parsing process.
TreeAutomaton	InterpretedTreeAutomaton.parseWithSiblingFinder(String interpretationName, Object input) Parses a single input representations to a parse chart without using a sibling finder in the intersection.

Methods in de.up.ling.irtg with parameters of type TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	Interpretation.basicNonDelInvHom(TreeAutomaton auto) This returns an inverse homomorphism automaton with the added assumption that the underlying homomorphism is non-deleting.
TreeAutomaton	InterpretedTreeAutomaton.decodeToAutomaton(String outputInterpretation, TreeAutomaton parseChart) Decodes a parse chart to a term chart over some output algebra.
Intersectable	Interpretation.invhom(TreeAutomaton auto) Returns the image under inverse homomorphism of the given automaton.

Constructors in de.up.ling.irtg with parameters of type TreeAutomaton

Constructor and Description
InterpretedTreeAutomaton(TreeAutomaton<String> automaton) Constructs a new IRTG with the given derivation tree automaton.

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

Subclasses of TreeAutomaton in de.up.ling.irtg.algebra

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.

Methods in de.up.ling.irtg.algebra that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	BinarizingAlgebra.binarizeTreeAutomaton(TreeAutomaton<? extends Object> underlyingAutomaton) Returns a tree automaton in which all rules are binarized by introducing intermediate rules with the concatenation symbol of this algebra.
TreeAutomaton	EvaluatingAlgebra.decompose(E value)
TreeAutomaton	BinarizingAlgebra.decompose(E value)
TreeAutomaton	Algebra.decompose(E value) Computes a decomposition automaton for the given value.
TreeAutomaton	WideStringAlgebra.decompose(List<String> value)
TreeAutomaton	StringAlgebra.decompose(List<String> words)
TreeAutomaton	TagStringAlgebra.decompose(Pair<List<String>,List<String>> value)
TreeAutomaton	SetAlgebra.decompose(Set<List<String>> value)
TreeAutomaton	TreeAlgebra.decompose(Tree<String> value)
TreeAutomaton	TagTreeAlgebra.decompose(Tree<String> value)
TreeAutomaton	TagTreeWithAritiesAlgebra.decompose(Tree<String> value)
TreeAutomaton	TreeWithAritiesAlgebra.decompose(Tree<String> value)

Methods in de.up.ling.irtg.algebra with parameters of type TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	BinarizingAlgebra.binarizeTreeAutomaton(TreeAutomaton<? extends Object> underlyingAutomaton) Returns a tree automaton in which all rules are binarized by introducing intermediate rules with the concatenation symbol of this algebra.

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

Subclasses of TreeAutomaton in de.up.ling.irtg.algebra.graph

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.

Methods in de.up.ling.irtg.algebra.graph that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	GraphAlgebra.decompose(SGraph value) Returns a bottom-up or a top-down decomposition automaton for the s-graph value (which one can be set via setUseTopDownAutomaton, default is bottom-up).
TreeAutomaton	GraphAlgebra.decompose(SGraph value, Class c) Given an SGraph, this returns the corresponding decomposition automaton of class c.
TreeAutomaton	GraphAlgebra.decomposeTopDown(SGraph value)

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

Subclasses of TreeAutomaton in de.up.ling.irtg.automata

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	UniversalAutomaton A tree automaton that accepts all terms over the given signature.

Methods in de.up.ling.irtg.automata that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton<Set<State>>	TreeAutomaton.determinize()
TreeAutomaton<Set<State>>	Determinizer.determinize(List<IntSet> newStateToOldStateSet) Returns a bottom up deterministic tree automaton for the underlying automaton.
TreeAutomaton<Set<State>>	TreeAutomaton.determinize(List<IntSet> newStateToOldStateSet)
TreeAutomaton	TreeAutomaton.homomorphism(Homomorphism hom) Computes the image of this automaton under a homomorphism.
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersect(Intersectable<OtherState> other) Intersects this automaton with another one.
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersect(TreeAutomaton<OtherState> other, SignatureMapper mapper)
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectBottomUp(TreeAutomaton<OtherState> other) Intersects this automaton with another one, using a bottom-up algorithm.
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectCondensed(CondensedTreeAutomaton<OtherState> other)
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectCondensed(CondensedTreeAutomaton<OtherState> other, PruningPolicy pp)
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectCondensed(CondensedTreeAutomaton<OtherState> other, SignatureMapper signatureMapper)
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectCondensedBottomUp(CondensedTreeAutomaton<OtherState> other)
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectCondensedBottomUp(CondensedTreeAutomaton<OtherState> other, SignatureMapper signatureMapper)
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectEarley(TreeAutomaton<OtherState> other) Intersects this automaton with another one, using an Earley-style intersection algorithm.
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectViterbi(CondensedTreeAutomaton<OtherState> other)
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectViterbi(CondensedTreeAutomaton<OtherState> other, SignatureMapper signatureMapper)
TreeAutomaton	TreeAutomaton.inverseHomomorphism(Homomorphism hom) Computes the pre-image of this automaton under a homomorphism.
TreeAutomaton<State>	TreeAutomaton.reduceTopDown() Reduces the automaton, top-down.

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

Modifier and Type	Method and Description
String	Rule.getLabel(TreeAutomaton auto)
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersect(TreeAutomaton<OtherState> other, SignatureMapper mapper)
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectBottomUp(TreeAutomaton<OtherState> other) Intersects this automaton with another one, using a bottom-up algorithm.
static IntersectionAutomaton	IntersectionAutomaton.intersectBottomUpNaive(TreeAutomaton lhs, TreeAutomaton rhs) Helper method which creates an intersection automaton and makes all rules explicit with the default algorithm.
static IntersectionAutomaton	IntersectionAutomaton.intersectBottomUpNaive(TreeAutomaton lhs, TreeAutomaton rhs) Helper method which creates an intersection automaton and makes all rules explicit with the default algorithm.
<OtherState> TreeAutomaton<Pair<State,OtherState>>	TreeAutomaton.intersectEarley(TreeAutomaton<OtherState> other) Intersects this automaton with another one, using an Earley-style intersection algorithm.
static IntersectionAutomaton	IntersectionAutomaton.intersectTopDownBottomUpCKY(TreeAutomaton lhs, TreeAutomaton rhs) Helper method which creates an intersection automaton and makes all rules explicit with the CKY algorithm.
static IntersectionAutomaton	IntersectionAutomaton.intersectTopDownBottomUpCKY(TreeAutomaton lhs, TreeAutomaton rhs) Helper method which creates an intersection automaton and makes all rules explicit with the CKY algorithm.
static boolean	InverseHomAutomaton.isFailedRule(Rule rule, TreeAutomaton auto)
static List<String>	Rule.rulesToStrings(Collection<Rule> rules, TreeAutomaton auto)
String	Rule.toString(TreeAutomaton auto)
String	Rule.toString(TreeAutomaton auto, boolean parentIsFinal)

Constructors in de.up.ling.irtg.automata with parameters of type TreeAutomaton

Constructor and Description
BestFirstIntersectionAutomaton(TreeAutomaton<LeftState> left, TreeAutomaton<RightState> right, EdgeEvaluator evaluator) Creates a new instance with the given evaluator.
BestFirstIntersectionAutomaton(TreeAutomaton<LeftState> left, TreeAutomaton<RightState> right, EdgeEvaluator evaluator) Creates a new instance with the given evaluator.
Determinizer(TreeAutomaton<State> originalAutomaton) Creates a new instance for the given instance.
IntersectionAutomaton(TreeAutomaton<LeftState> left, TreeAutomaton<RightState> right) Crates a new instance which represents the intersection of the two given automata.
IntersectionAutomaton(TreeAutomaton<LeftState> left, TreeAutomaton<RightState> right) Crates a new instance which represents the intersection of the two given automata.
InverseHomAutomaton(TreeAutomaton<State> rhsAutomaton, Homomorphism hom)
NondeletingInverseHomAutomaton(TreeAutomaton<State> rhsAutomaton, Homomorphism hom)
SkipFailRulesFilter(TreeAutomaton auto)

Uses of TreeAutomaton in de.up.ling.irtg.automata.coarse_to_fine

Methods in de.up.ling.irtg.automata.coarse_to_fine that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	CoarseToFineParser.Combination.getChart()
TreeAutomaton	RuleRefinementTree.makeCoarsestAutomaton(TreeAutomaton fineAutomaton)
TreeAutomaton	CoarseToFineParser.parse(String input) This method is a shorter alias for CoarseToFineParser.parseInputObject(java.lang.Object) which also takes care of decoding the string representation of the input into a suitable object.
TreeAutomaton	CoarseToFineParser.parseInputObject(Object inputObject) Uses coarse to fine parsing to produce a pruned parse chart for the input object.
TreeAutomaton	CoarseToFineParser.parseInputObjectWithSF(Object inputObject) Uses coarse to fine parsing to produce a pruned parse chart for the input object.

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

Modifier and Type	Method and Description
void	RuleRefinementNode.appendLocalToString(TreeAutomaton<String> auto, String prefix, StringBuilder buf)
void	RuleRefinementNode.foreachRule(Consumer<Rule> fn, TreeAutomaton auto)
String	RuleRefinementNode.localToString(TreeAutomaton<String> auto)
TreeAutomaton	RuleRefinementTree.makeCoarsestAutomaton(TreeAutomaton fineAutomaton)
String	RuleRefinementTree.toString(TreeAutomaton auto)
String	RuleRefinementNode.toString(TreeAutomaton<String> auto)

Constructors in de.up.ling.irtg.automata.coarse_to_fine with parameters of type TreeAutomaton

Constructor and Description
Combination(TreeAutomaton chart, DoubleList seen, DoubleList pruned, DoubleList rulesInChart, DoubleList inverseRules, DoubleList grammarRules, DoubleList saturation, DoubleList stateSaturation, DoubleList binarizedStateSaturation, double initialTime, DoubleList timeTakenForLevel, DoubleList rulesPruned)
SiblingFinderCoarserstParser(RuleRefinementTree rrt, Homomorphism origHom, TreeAutomaton decomp)

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

Subclasses of TreeAutomaton in de.up.ling.irtg.automata.condensed

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.

Methods in de.up.ling.irtg.automata.condensed that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	NonCondensedIntersectionAutomaton.IntersectionCall.intersect(TreeAutomaton left, CondensedTreeAutomaton right)
TreeAutomaton	GenericCondensedIntersectionAutomaton.IntersectionCall.intersect(TreeAutomaton left, CondensedTreeAutomaton right)

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

Modifier and Type	Method and Description
void	ConcreteCondensedTreeAutomaton.absorbTreeAutomaton(TreeAutomaton<State> auto) Copies all rules from a TreeAutomaton to this automaton.
static <E> ConcreteCondensedTreeAutomaton<E>	ConcreteCondensedTreeAutomaton.fromTreeAutomaton(TreeAutomaton<E> origin) Creates a new CondensedTreeAutomaton based on the rules and final states of another TreeAutomaton.
TreeAutomaton	NonCondensedIntersectionAutomaton.IntersectionCall.intersect(TreeAutomaton left, CondensedTreeAutomaton right)
TreeAutomaton	GenericCondensedIntersectionAutomaton.IntersectionCall.intersect(TreeAutomaton left, CondensedTreeAutomaton right)
static NonCondensedIntersectionAutomaton	NonCondensedIntersectionAutomaton.intersectTopDownBottomUpNonCondensed(TreeAutomaton lhs, CondensedTreeAutomaton rhs)
CondensedTreeAutomaton<State>	PatternMatchingInvhomAutomatonFactory.invhom(TreeAutomaton<State> rhs) Computes the image under inverse homomorphism of the decomposition automaton rhs.
static CondensedTreeAutomaton	PMFactoryRestrictive.invhomWithNewFactory(TreeAutomaton rhs, Homomorphism hom)

Constructors in de.up.ling.irtg.automata.condensed with parameters of type TreeAutomaton

Constructor and Description
CondensedBottomUpIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper)
CondensedIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right) Assumes the signatures are identical.
CondensedIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper)
CondensedIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper, boolean debug)
CondensedIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper, PruningPolicy pp)
CondensedNondeletingInverseHomAutomaton(TreeAutomaton<State> rhsAutomaton, Homomorphism hom)
CondensedViterbiIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper)
GenericCondensedIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper)
GenericCondensedIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper, PruningPolicy pp)
NonCondensedIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right) Assumes the signatures are identical.
NonCondensedIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper)
NonCondensedIntersectionAutomaton(TreeAutomaton<LeftState> left, CondensedTreeAutomaton<RightState> right, SignatureMapper sigMapper, boolean debug)

Uses of TreeAutomaton in de.up.ling.irtg.automata.index

Constructors in de.up.ling.irtg.automata.index with parameters of type TreeAutomaton

Constructor and Description
BinaryBottomUpRuleIndex(TreeAutomaton auto)
MapTopDownIndex(TreeAutomaton auto)
RuleStore(TreeAutomaton auto)
RuleStore(TreeAutomaton auto, TopDownRuleIndex topDown, BottomUpRuleIndex bottomUp)

Uses of TreeAutomaton in de.up.ling.irtg.automata.language_iteration

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

Modifier and Type	Method and Description
String	EvaluatedItem.toString(TreeAutomaton auto)

Constructors in de.up.ling.irtg.automata.language_iteration with parameters of type TreeAutomaton

Constructor and Description
SortedLanguageIterator(TreeAutomaton<State> auto)
SortedLanguageIterator(TreeAutomaton<State> auto, RuleRefiner ruleRefiner, ItemEvaluator itemEvaluator)

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

Subclasses of TreeAutomaton in de.up.ling.irtg.binarization

Modifier and Type	Class and Description
static class	StringAlgebraSeed.OneSymbolAutomaton

Methods in de.up.ling.irtg.binarization that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	StringAlgebraSeed.binarize(String symbol)
abstract TreeAutomaton<String>	RegularSeed.binarize(String symbol) Computes an automaton for all binarizations of a given symbol.
TreeAutomaton<String>	IdentitySeed.binarize(String symbol)
TreeAutomaton<String>	BinarizingAlgebraSeed.binarize(String symbol)
TreeAutomaton<String>	RegularSeed.binarize(Tree<String> term) Computes an automaton for all binarizations of a given term.

Uses of TreeAutomaton in de.up.ling.irtg.codec

Methods in de.up.ling.irtg.codec that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	TreeAutomatonInputCodec.read(InputStream is)
TreeAutomaton	BottomUpTreeAutomatonInputCodec.read(InputStream is)
TreeAutomaton	TiburonTreeAutomatonInputCodec.read(InputStream is)

Uses of TreeAutomaton in de.up.ling.irtg.corpus

Methods in de.up.ling.irtg.corpus that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	Instance.getChart()

Methods in de.up.ling.irtg.corpus with parameters of type TreeAutomaton

Modifier and Type	Method and Description
void	Instance.setChart(TreeAutomaton chart)
String	Instance.toString(TreeAutomaton auto)
Instance	Instance.withChart(TreeAutomaton chart)

Uses of TreeAutomaton in de.up.ling.irtg.gui

Methods in de.up.ling.irtg.gui with parameters of type TreeAutomaton

Modifier and Type	Method and Description
static boolean	GuiMain.saveAutomaton(TreeAutomaton auto, Component parent)
void	JLanguageViewer.setAutomaton(TreeAutomaton automaton, InterpretedTreeAutomaton irtg)

Constructors in de.up.ling.irtg.gui with parameters of type TreeAutomaton

Constructor and Description
JTreeAutomaton(TreeAutomaton<?> automaton, TreeAutomatonAnnotator annotator) Creates new form JInterpretedTreeAutomaton

Uses of TreeAutomaton in de.up.ling.irtg.maxent

Methods in de.up.ling.irtg.maxent that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	MaximumEntropyIrtg.parseInputObjects(Map<String,Object> inputs) Parses an input of representations and their name and computes a chart for this input The member variable useIrtgParser indicates which parser to use True: the parser of InterpretedTreeAutomaton will be used False: an implementation of a CKY-parser will be used

Methods in de.up.ling.irtg.maxent with parameters of type TreeAutomaton

Modifier and Type	Method and Description
abstract V	FeatureFunction.evaluate(Rule rule, TreeAutomaton<State> automaton, MaximumEntropyIrtg irtg, Map<String,Object> inputs) Computes the value of the feature function for a given rule.
Double	RuleNameFeature.evaluate(Rule rule, TreeAutomaton<String> automaton, MaximumEntropyIrtg irtg, Map<String,Object> inputs)
Double	ChildOfFeature.evaluate(Rule rule, TreeAutomaton<String> automaton, MaximumEntropyIrtg irtg, Map<String,Object> inputs)

Constructors in de.up.ling.irtg.maxent with parameters of type TreeAutomaton

Constructor and Description
MaximumEntropyIrtg(TreeAutomaton<String> automaton, Map<String,FeatureFunction> featureMap) Constructor

Uses of TreeAutomaton in de.up.ling.irtg.random_automata

Methods in de.up.ling.irtg.random_automata that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton<Integer>	RandomTreeAutomaton.getRandomAutomaton(int n) Returns a new random tree automaton that is based on a decomposition automaton for the sequence '0 1 ...

Uses of TreeAutomaton in de.up.ling.irtg.sampling

Methods in de.up.ling.irtg.sampling that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	RuleWeighting.getAutomaton() Returns the underlying tree automaton from which the rules and start states are drawn.

Methods in de.up.ling.irtg.sampling with parameters of type TreeAutomaton

Modifier and Type	Method and Description
List<TreeSample<Rule>>	AdaptiveImportanceSampler.Configuration.run(TreeAutomaton ta) Runs an importance sampler once for the given configuration.

Method parameters in de.up.ling.irtg.sampling with type arguments of type TreeAutomaton

Modifier and Type	Method and Description
<Type> TreeSample<Type>	Proposal.getTreeSample(BiFunction<Rule,TreeAutomaton,Type> mapping, RuleWeighting guide, int numberOfSamples) This method samples a number of rule trees and transforms them into the desired type of tree by applying the mapping to the tree and the automaton the guide returns.

Constructor parameters in de.up.ling.irtg.sampling with type arguments of type TreeAutomaton

Constructor and Description
Configuration(Function<TreeAutomaton,RuleWeighting> rwSource) Creates a new instance with default parameters and based on the given RuleWeightings

Uses of TreeAutomaton in de.up.ling.irtg.sampling.rule_weighting

Methods in de.up.ling.irtg.sampling.rule_weighting that return TreeAutomaton

Modifier and Type	Method and Description
TreeAutomaton	RegularizedKLRuleWeighting.getAutomaton()

Constructors in de.up.ling.irtg.sampling.rule_weighting with parameters of type TreeAutomaton

Constructor and Description
AutomatonWeighted(TreeAutomaton basis, int regularizationExponent, double regularizationDivisor, LearningRate rate) Creates a new instance that weights trees according to the rule weights from the given automaton and uses the automaton as the basis for sampling.
RegularizedKLRuleWeighting(TreeAutomaton basis, int regularizationExponent, double regularizationDivisor, LearningRate rate) Creates a new instance with the regularization given by the specified values.

Uses of TreeAutomaton in de.up.ling.irtg.script

Fields in de.up.ling.irtg.script declared as TreeAutomaton

Modifier and Type	Field and Description
static TreeAutomaton	SGraphParsingEvaluation.rhs

Methods in de.up.ling.irtg.script with parameters of type TreeAutomaton

Modifier and Type	Method and Description
static <Type> DoubleList	EvaluateSamplingFromRules.computeTargetFunction(TreeAutomaton<Type> ta, AdaptiveImportanceSampler.Configuration config) Computes the expected value for all the different evaluation rounds in a single repetition.
static <Type> Pair<DoubleList,List<DoubleList>>	EvaluateSamplingFromRules.makeInside(TreeAutomaton<Type> ta, AdaptiveImportanceSampler.Configuration config, int repetitions, boolean printTracking) Computes the expected value average over all repetitions and then a list of expected values per round for each repetition.

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

Constructors in de.up.ling.irtg.siblingfinder with parameters of type TreeAutomaton

Constructor and Description
SiblingFinderIntersection(TreeAutomaton<LeftState> leftAutomaton, SiblingFinderInvhom<RightState> rightAutomaton)
SiblingFinderInvhom(TreeAutomaton<State> decompositionAutomaton, Homomorphism hom)

Uses of TreeAutomaton in de.up.ling.irtg.util

Methods in de.up.ling.irtg.util that return TreeAutomaton

Modifier and Type	Method and Description
static TreeAutomaton	TestingTools.pa(InputStream s)
static TreeAutomaton	TestingTools.pa(String s)

Methods in de.up.ling.irtg.util with parameters of type TreeAutomaton

Modifier and Type	Method and Description
static Set<Rule>	TestingTools.rbu(String label, List children, TreeAutomaton auto)
static Rule	TestingTools.rule(String parent, String label, List<String> children, TreeAutomaton automaton)