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

Packages that use Rule

Package	Description
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.automata.pruning	This package implements beam search in the construction of a parse chart.
de.up.ling.irtg.binarization	Classes for binarizing IRTGs.
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.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.semiring	A number of semirings used in computation over tree automata.
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 Rule in de.up.ling.irtg.algebra

Methods in de.up.ling.irtg.algebra that return types with arguments of type Rule

Modifier and Type	Method and Description
Set<Rule>	TagStringAlgebra.TagDecompositionAutomaton.getRulesBottomUp(int labelId, int[] childStates)
Set<Rule>	TagStringAlgebra.TagDecompositionAutomaton.getRulesTopDown(int label, int parentStateId)

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

Methods in de.up.ling.irtg.algebra.graph that return types with arguments of type Rule

Modifier and Type	Method and Description
Iterable<Rule>	SGraphBRDecompositionAutomatonBottomUp.getRulesBottomUp(int labelId, int[] childStates)
Iterable<Rule>	SGraphBRDecompositionAutomatonTopDown.getRulesBottomUp(int labelId, int[] childStates)
Iterable<Rule>	SGraphBRDecompositionAutomatonBottomUp.getRulesTopDown(int labelId, int parentState)
Iterable<Rule>	SGraphBRDecompositionAutomatonTopDown.getRulesTopDown(int labelId, int parentState)

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

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

Modifier and Type	Method and Description
Rule	TreeAutomaton.createRule(int parent, int label, int[] children, double weight) Creates a new rule.
Rule	TreeAutomaton.createRule(int parent, int label, List<Integer> children, double weight) Creates a new rule.
Rule	TreeAutomaton.createRule(State parent, String label, List<State> children) Creates a rule for this automaton.
Rule	TreeAutomaton.createRule(State parent, String label, List<State> children, double weight) Creates a weighted rule for this automaton.
Rule	TreeAutomaton.createRule(State parent, String label, State[] children) Creates a rule for this automaton.
Rule	TreeAutomaton.createRule(State parent, String label, State[] children, double weight) Creates a weighted rule for this automaton.

Methods in de.up.ling.irtg.automata that return types with arguments of type Rule

Modifier and Type	Method and Description
Iterable<Rule>	TreeAutomaton.getAllRulesTopDown()
Tree<Rule>	TreeAutomaton.getRandomRuleTree()
Tree<Rule>	TreeAutomaton.getRandomRuleTreeFromInside()
abstract Iterable<Rule>	TreeAutomaton.getRulesBottomUp(int labelId, int[] childStates) Finds automaton rules bottom-up for a given list of child states and a given parent label.
Iterable<Rule>	NondeletingInverseHomAutomaton.getRulesBottomUp(int label, int[] childStates)
Set<Rule>	SingletonAutomaton.getRulesBottomUp(int label, int[] childStates)
Set<Rule>	UniversalAutomaton.getRulesBottomUp(int label, int[] childStates)
Iterable<Rule>	InverseHomAutomaton.getRulesBottomUp(int label, int[] childStates)
Iterable<Rule>	IntersectionAutomaton.getRulesBottomUp(int label, int[] childStates)
Iterable<Rule>	ConcreteTreeAutomaton.getRulesBottomUp(int label, int[] childStates)
Iterable<Rule>	TreeAutomaton.getRulesBottomUp(int labelId, List<Integer> childStates) Finds automaton rules bottom-up.
Iterable<Rule>	TreeAutomaton.getRulesBottomUp(IntSet labelIds, List<Integer> childStates) Finds automaton rules bottom-up for a given list of child states and a given set of parent labels.
Set<Rule>	NondeletingInverseHomAutomaton.getRulesBottomUpFromExplicitWithTermID(int termID, int[] childStates)
Iterable<Rule>	TreeAutomaton.getRuleSet() Returns the set of all rules of this automaton.
Iterable<Rule>	TreeAutomaton.getRulesForRhsState(int rhsState)
Iterable<Rule>	TreeAutomaton.getRulesTopDown(int parentState) Finds all automaton rules top-down with a given state on the left-hand side.
abstract Iterable<Rule>	TreeAutomaton.getRulesTopDown(int labelId, int parentState) Finds automaton rules top-down for a given parent state and label.
Set<Rule>	NondeletingInverseHomAutomaton.getRulesTopDown(int label, int parentState)
Set<Rule>	SingletonAutomaton.getRulesTopDown(int label, int parentState)
Set<Rule>	UniversalAutomaton.getRulesTopDown(int label, int parentState)
Iterable<Rule>	InverseHomAutomaton.getRulesTopDown(int label, int parentState)
Iterable<Rule>	IntersectionAutomaton.getRulesTopDown(int label, int parentState)
Iterable<Rule>	ConcreteTreeAutomaton.getRulesTopDown(int label, int parentState)
Tree<Rule>	TreeAutomaton.getRuleTree(Tree<Integer> derivationTree) Returns a tree of automaton rules that generates the given tree.

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

Modifier and Type	Method and Description
void	ConcreteTreeAutomaton.addRule(Rule rule) Adds the rule to the automaton.
boolean	SkipFailRulesFilter.apply(Rule t)
int	Rule.compareTo(Rule o)
E	RuleEvaluator.evaluateRule(Rule rule)
E	RuleEvaluatorTopDown.evaluateRule(Rule rule, int i)
static boolean	InverseHomAutomaton.isFailedRule(Rule rule, TreeAutomaton auto)
default void	EdgeEvaluator.ruleAdded(Rule rule) This method is called each time a rule is added to the output automaton.

Method parameters in de.up.ling.irtg.automata with type arguments of type Rule

Modifier and Type	Method and Description
static Collection<Integer>	Rule.extractParentStates(Collection<Rule> rules)
void	TreeAutomaton.foreachRuleBottomUpForSets(IntSet labelIds, List<IntSet> childStateSets, SignatureMapper signatureMapper, Consumer<Rule> fn)
void	ConcreteTreeAutomaton.foreachRuleBottomUpForSets(IntSet labelIds, List<IntSet> childStateSets, SignatureMapper signatureMapper, Consumer<Rule> fn)
void	TreeAutomaton.foreachRuleTopDown(int parentState, Consumer<Rule> fn) Iterates over all rules with the given parent.
boolean	TreeAutomaton.processAllRulesBottomUp(Consumer<Rule> processingFunction) Iterates through all rules top-down, applying processingFunction to each rule found.
void	TreeAutomaton.processAllRulesTopDown(Consumer<Rule> processingFunction) Iterates through all rules top-down, applying processingFunction to each rule found.
static List<String>	Rule.rulesToStrings(Collection<Rule> rules, TreeAutomaton auto)
void	TreeAutomaton.setRulePrintingFilter(com.google.common.base.Predicate<Rule> filter) Sets a filter for printing the automaton's rules.
void	TreeAutomaton.BottomUpStateVisitor.visit(int state, Iterable<Rule> rulesTopDown)

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

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

Modifier and Type	Method and Description
RuleRefinementNode	RuleRefinementTree.getFinestNodeForRule(Rule rule)

Method parameters in de.up.ling.irtg.automata.coarse_to_fine with type arguments of type Rule

Modifier and Type	Method and Description
void	RuleRefinementNode.foreachRule(Consumer<Rule> fn, TreeAutomaton auto)
ConcreteTreeAutomaton	SiblingFinderCoarserstParser.parse(List<RuleRefinementNode> coarseNodes, List<Rule> partnerInvhomRules) Note: returns the invhom automaton for future reference.

Constructor parameters in de.up.ling.irtg.automata.coarse_to_fine with type arguments of type Rule

Constructor and Description
RuleRefinementTree(List<RuleRefinementNode> toplevel, List<IntSet> finalStatesPerLevel, Function<Rule,RuleRefinementNode> finestNodes)

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

Methods in de.up.ling.irtg.automata.condensed that return types with arguments of type Rule

Modifier and Type	Method and Description
Iterable<Rule>	NonCondensedIntersectionAutomaton.getRulesBottomUp(int label, int[] childStates)
Iterable<Rule>	GenericCondensedIntersectionAutomaton.getRulesBottomUp(int label, int[] childStates)
Set<Rule>	CondensedTreeAutomaton.getRulesBottomUp(int labelId, int[] childStates)
Iterable<Rule>	CondensedBottomUpIntersectionAutomaton.getRulesBottomUp(int labelId, int[] childStates)
Iterable<Rule>	NonCondensedIntersectionAutomaton.getRulesTopDown(int label, int parentState)
Iterable<Rule>	GenericCondensedIntersectionAutomaton.getRulesTopDown(int label, int parentState)
Set<Rule>	CondensedTreeAutomaton.getRulesTopDown(int labelId, int parentState)
Iterable<Rule>	CondensedBottomUpIntersectionAutomaton.getRulesTopDown(int labelId, int parentState)

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

Methods in de.up.ling.irtg.automata.index that return types with arguments of type Rule

Modifier and Type	Method and Description
abstract Collection<Rule>	BottomUpRuleIndex.get(int labelId, int[] childStates)
Collection<Rule>	TrieBottomUpRuleIndex.get(int labelId, int[] childStates)
Collection<Rule>	BinaryBottomUpRuleIndex.get(int labelId, int[] childStates)
abstract Iterable<Rule>	BottomUpRuleIndex.getAllRules()
Iterable<Rule>	MapTopDownIndex.getAllRules()
Iterable<Rule>	TopDownRuleIndex.getAllRules()
Iterable<Rule>	TrieBottomUpRuleIndex.getAllRules()
Iterable<Rule>	BinaryBottomUpRuleIndex.getAllRules()
Iterable<Rule>	RuleStore.getAllRulesBottomUp()
Iterable<Rule>	RuleStore.getAllRulesTopDown()
Iterable<Rule>	MapTopDownIndex.getRules(int parentState)
Iterable<Rule>	TopDownRuleIndex.getRules(int parentState) Retrieves the rules for a given parent state.
Iterable<Rule>	MapTopDownIndex.getRules(int labelId, int parentState)
Iterable<Rule>	TopDownRuleIndex.getRules(int labelId, int parentState) Retrieves the rules for a given parent state and terminal symbol.
Iterable<Rule>	RuleStore.getRulesBottomUp(int labelId, int[] childStates) Like getRulesBottomUp, but only looks for rules in the cache of previously discovered rules.
Iterable<Rule>	RuleStore.getRulesBottomUpRaw(int labelId, int[] childStates) Returns null if such rules were never cached.
List<Iterable<Rule>>	RuleStore.getRulesForRhsState(int rhsState)
Iterable<Rule>	RuleStore.getRulesTopDown(int parentState)
Iterable<Rule>	RuleStore.getRulesTopDown(int labelId, int parentState) Like getRulesTopDown, but only looks for rules in the cache of previously discovered rules.
Collection<Rule>	RuleStore.setRules(Collection<Rule> rules, int labelID, int[] children)

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

Modifier and Type	Method and Description
boolean	BottomUpRuleIndex.add(Rule rule) Returns false if adding this rule makes the automaton bottom-up nondeterministic.
void	MapTopDownIndex.add(Rule rule)
void	TopDownRuleIndex.add(Rule rule) Adds a rule to the index.
boolean	TrieBottomUpRuleIndex.add(Rule rule)
void	RuleStore.storeRuleBottomUp(Rule rule)
void	RuleStore.storeRuleTopDown(Rule rule)

Method parameters in de.up.ling.irtg.automata.index with type arguments of type Rule

Modifier and Type	Method and Description
void	MapTopDownIndex.foreachRule(int parentState, Consumer<Rule> fn)
void	TopDownRuleIndex.foreachRule(int parentState, Consumer<Rule> fn)
void	RuleStore.foreachRuleBottomUpForSets(IntSet labelIds, List<IntSet> childStateSets, SignatureMapper signatureMapper, Consumer<Rule> fn)
abstract void	BottomUpRuleIndex.foreachRuleForSets(IntSet labelIds, List<IntSet> childStateSets, SignatureMapper signatureMapper, Consumer<Rule> fn)
void	TrieBottomUpRuleIndex.foreachRuleForSets(IntSet labelIds, List<IntSet> childStateSets, SignatureMapper signatureMapper, Consumer<Rule> fn)
void	BinaryBottomUpRuleIndex.foreachRuleForSets(IntSet labelIds, List<IntSet> childStateSets, SignatureMapper signatureMapper, Consumer<Rule> fn)
void	RuleStore.foreachRuleTopDown(int parentState, Consumer<Rule> fn)
abstract void	BottomUpRuleIndex.setRules(Collection<Rule> rules, int labelId, int[] childStates)
Collection<Rule>	RuleStore.setRules(Collection<Rule> rules, int labelID, int[] children)
void	TrieBottomUpRuleIndex.setRules(Collection<Rule> rules, int labelId, int[] childStates)
void	BinaryBottomUpRuleIndex.setRules(Collection<Rule> rules, int labelId, int[] childStates)

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

Methods in de.up.ling.irtg.automata.language_iteration that return types with arguments of type Rule

Modifier and Type	Method and Description
List<Rule>	IdentityRuleRefiner.refine(Rule rule)
List<Rule>	RuleRefiner.refine(Rule rule)

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

Modifier and Type	Method and Description
EvaluatedItem<Q>	ItemEvaluator.evaluate(Rule refinedRule, List<EvaluatedItem<Q>> children, UnevaluatedItem unevaluatedItem)
EvaluatedItem<Void>	TreeCombiningItemEvaluator.evaluate(Rule refinedRule, List<EvaluatedItem<Void>> children, UnevaluatedItem unevaluatedItem)
List<Rule>	IdentityRuleRefiner.refine(Rule rule)
List<Rule>	RuleRefiner.refine(Rule rule)

Uses of Rule in de.up.ling.irtg.automata.pruning

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

Modifier and Type	Method and Description
void	RulePairConsumer.accept(Rule left, CondensedRule right, double value)
void	StatewiseHistogramPruningPolicy.collect(int rightParent, Rule left, CondensedRule right)
void	HistogramPruningPolicy.collect(int rightParent, Rule left, CondensedRule right)
void	QuotientPruningPolicy.collect(int rightParent, Rule left, CondensedRule right)
void	PruningPolicy.collect(int rightParent, Rule left, CondensedRule right)
void	NoPruningPolicy.collect(int rightParent, Rule left, CondensedRule right)
double	SemiringFOM.evaluate(Rule left, CondensedRule right)
double	FOM.evaluate(Rule left, CondensedRule right)

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

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

Modifier and Type	Method and Description
Rule	GensymBinaryRuleFactory.generateBinarizedRule(Tree<String> nodeInVartree, List<String> binarizedChildStates, String pathToNode, Rule originalRule, Tree<String> vartree, InterpretedTreeAutomaton originalIrtg, InterpretedTreeAutomaton binarizedIrtg)
Rule	InsideRuleFactory.generateBinarizedRule(Tree<String> nodeInVartree, List<String> binarizedChildStates, String pathToNode, Rule originalRule, Tree<String> vartree, InterpretedTreeAutomaton originalIrtg, InterpretedTreeAutomaton binarizedIrtg) Generates an automaton rule for a single node of the common variable tree.
Rule	BinaryRuleFactory.generateBinarizedRule(Tree<String> nodeInVartree, List<String> binarizedChildStates, String pathToNode, Rule originalRule, Tree<String> vartree, InterpretedTreeAutomaton originalIrtg, InterpretedTreeAutomaton binarizedIrtg) Generates an automaton rule for a single node of the common variable tree.
Rule	XbarRuleFactory.generateBinarizedRule(Tree<String> nodeInVartree, List<String> binarizedChildStates, String pathToNode, Rule originalRule, Tree<String> vartree, InterpretedTreeAutomaton originalIrtg, InterpretedTreeAutomaton binarizedIrtg)

Methods in de.up.ling.irtg.binarization with parameters of type Rule

Modifier and Type	Method and Description
Rule	GensymBinaryRuleFactory.generateBinarizedRule(Tree<String> nodeInVartree, List<String> binarizedChildStates, String pathToNode, Rule originalRule, Tree<String> vartree, InterpretedTreeAutomaton originalIrtg, InterpretedTreeAutomaton binarizedIrtg)
Rule	InsideRuleFactory.generateBinarizedRule(Tree<String> nodeInVartree, List<String> binarizedChildStates, String pathToNode, Rule originalRule, Tree<String> vartree, InterpretedTreeAutomaton originalIrtg, InterpretedTreeAutomaton binarizedIrtg) Generates an automaton rule for a single node of the common variable tree.
Rule	BinaryRuleFactory.generateBinarizedRule(Tree<String> nodeInVartree, List<String> binarizedChildStates, String pathToNode, Rule originalRule, Tree<String> vartree, InterpretedTreeAutomaton originalIrtg, InterpretedTreeAutomaton binarizedIrtg) Generates an automaton rule for a single node of the common variable tree.
Rule	XbarRuleFactory.generateBinarizedRule(Tree<String> nodeInVartree, List<String> binarizedChildStates, String pathToNode, Rule originalRule, Tree<String> vartree, InterpretedTreeAutomaton originalIrtg, InterpretedTreeAutomaton binarizedIrtg)

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

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

Modifier and Type	Method and Description
String	TreeAutomatonAnnotator.getAnnotation(Rule rule, String annotationIdentifier)
String	IrtgTreeAutomatonAnnotator.getAnnotation(Rule rule, String annotationIdentifier)

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

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

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)

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

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

Modifier and Type	Method and Description
Rule	RuleWeighting.getRuleByNumber(int state, int number) Returns the rule identified by the given state and number.

Methods in de.up.ling.irtg.sampling that return types with arguments of type Rule

Modifier and Type	Method and Description
List<TreeSample<Rule>>	AdaptiveImportanceSampler.adaSample(int rounds, int populationSize, RuleWeighting rw, boolean deterministic, boolean reset) Runs the sampler for the given number of rounds with the given population size and adapting the given rule weights.
TreeSample<Rule>	AdaptiveImportanceSampler.adaSampleMinimal(int rounds, int populationSize, RuleWeighting rw, boolean deterministic, boolean reset) Runs the sampler for the given number of rounds with the given population size and adapting the given rule weights.
TreeSample<Rule>	Proposal.getTreeSample(RuleWeighting guide, int sampleSize) Returns a sample of rule trees.
List<TreeSample<Rule>>	AdaptiveImportanceSampler.Configuration.run(TreeAutomaton ta) Runs an importance sampler once for the given configuration.

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

Modifier and Type	Method and Description
double	RuleWeighting.getLogProbability(Rule r) Returns the proposal probability of the given rule given its parent.

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

Modifier and Type	Method and Description
void	RuleWeighting.adapt(TreeSample<Rule> treSamp, boolean deterministic) Adapts the proposal distribution with the assumption that treSamp is an importance sample generated from this proposal distribution.
double	ProposalSumComputer.computeInside(Tree<Rule> input, int state, RuleWeighting weights) Computes the proposal probability for the given tree assuming the given rule weights and assuming that we start at the given state.
double	ProposalSumComputer.computeInside(Tree<Rule> input, RuleWeighting weights) Computes the proposal probability for the given tree assuming the given rule weights.
void	ProposalSumComputer.fillInsides(TreeSample<Rule> sample, RuleWeighting rw) Computes the proposal probability for each tree in the sample assuming the given rule weightings and sets it as the log sum weight of the sample.
double	RuleWeighting.getLogTargetProbability(Tree<Rule> sample) Returns the unnormalized probability of the given tree in the target distribution.
<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.

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

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

Modifier and Type	Method and Description
Rule	RegularizedKLRuleWeighting.getRuleByNumber(int state, int number)

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

Modifier and Type	Method and Description
double	RegularizedKLRuleWeighting.getLogProbability(Rule r)

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

Modifier and Type	Method and Description
void	RegularizedKLRuleWeighting.adapt(TreeSample<Rule> treSamp, boolean deterministic)
double	AutomatonWeighted.getLogTargetProbability(Tree<Rule> sample)

Uses of Rule in de.up.ling.irtg.semiring

Methods in de.up.ling.irtg.semiring that return types with arguments of type Rule

Modifier and Type	Method and Description
Pair<Double,Rule>	ViterbiWithBackpointerSemiring.add(Pair<Double,Rule> x, Pair<Double,Rule> y)
Pair<Double,Rule>	ViterbiWithBackpointerSemiring.multiply(Pair<Double,Rule> x, Pair<Double,Rule> y)
Pair<Double,Rule>	ViterbiWithBackpointerSemiring.zero()

Method parameters in de.up.ling.irtg.semiring with type arguments of type Rule

Modifier and Type	Method and Description
Pair<Double,Rule>	ViterbiWithBackpointerSemiring.add(Pair<Double,Rule> x, Pair<Double,Rule> y)
Pair<Double,Rule>	ViterbiWithBackpointerSemiring.add(Pair<Double,Rule> x, Pair<Double,Rule> y)
Pair<Double,Rule>	ViterbiWithBackpointerSemiring.multiply(Pair<Double,Rule> x, Pair<Double,Rule> y)
Pair<Double,Rule>	ViterbiWithBackpointerSemiring.multiply(Pair<Double,Rule> x, Pair<Double,Rule> y)

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

Methods in de.up.ling.irtg.siblingfinder that return types with arguments of type Rule

Modifier and Type	Method and Description
Iterable<Rule>	SiblingFinderInvhom.getConstantBottomUp(int label)
Iterable<Rule>	SiblingFinderIntersection.getRulesBottomUp(int childState)
Iterable<Rule>	SiblingFinderInvhom.getRulesBottomUp(int childState, int pos, int label) Returns all rules with label 'label' and child childState at position pos.

Method parameters in de.up.ling.irtg.siblingfinder with type arguments of type Rule

Modifier and Type	Method and Description
void	SiblingFinderIntersection.makeAllRulesExplicit(Consumer<Rule> consumer)

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

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

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

Methods in de.up.ling.irtg.util that return types with arguments of type Rule

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

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

Modifier and Type	Method and Description
EvaluatedItem<Void>	TestingTools.MultiplyMapItemEvaluator.evaluate(Rule refinedRule, List<EvaluatedItem<Void>> children, UnevaluatedItem unevaluatedItem)