Package | Description |
---|---|
de.citec.tcs.alignment.adp |
This package contains a more general approach to construct
AlignmentAlgorithms by relying on the theoretical concept of Algebraic
Dynamic Programming (ADP) as developed by Giegerich et al.
|
Modifier and Type | Method and Description |
---|---|
LinkedList<ProductionRule<AffineGrammar.Nonterminal>> |
AffineGrammar.getPossibleRules(AffineGrammar.Nonterminal nonterminal,
int leftSize,
int rightSize)
Returns all production rules of this grammar that can be applied
in the current situation.
|
ArrayList<ProductionRule<GlobalAsymmetricGrammar.Nonterminal>> |
GlobalAsymmetricGrammar.getPossibleRules(GlobalAsymmetricGrammar.Nonterminal nonterminal,
int leftSize,
int rightSize)
Returns all production rules of this grammar that can be applied
in the current situation.
|
ArrayList<ProductionRule<GlobalGrammar.Nonterminal>> |
GlobalGrammar.getPossibleRules(GlobalGrammar.Nonterminal nonterminal,
int leftSize,
int rightSize)
Returns all production rules of this grammar that can be applied
in the current situation.
|
List<ProductionRule<N>> |
Grammar.getPossibleRules(N nonterminal,
int leftSize,
int rightSize)
Returns all production rules of this grammar that can be applied
in the current situation.
|
ArrayList<ProductionRule<N>> |
FlexibleGrammar.getPossibleRules(N nonterminal,
int leftSize,
int rightSize)
Returns all production rules of this grammar that can be applied
in the current situation.
|
EnumMap<N,ArrayList<ProductionRule<N>>> |
FlexibleGrammar.getRules()
Returns all production rules that are stored in this grammar.
|
Modifier and Type | Method and Description |
---|---|
void |
FlexibleGrammar.addRule(N left,
ProductionRule<N> rule)
Adds a production rule to this grammar.
|
Copyright (C) 2013-2015 Benjamin Paaßen, Georg Zentgraf, AG Theoretical Computer Science, Centre of Excellence Cognitive Interaction Technology (CITEC), University of Bielefeld, licensed under the AGPL v. 3: http://openresearch.cit-ec.de/projects/tcs