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 |
---|---|
GlobalAsymmetricGrammar.Nonterminal[] |
GlobalAsymmetricGrammar.dependencySort() |
GlobalAsymmetricGrammar.Nonterminal |
GlobalAsymmetricGrammar.getAxiom() |
static GlobalAsymmetricGrammar.Nonterminal |
GlobalAsymmetricGrammar.Nonterminal.valueOf(String name)
Returns the enum constant of this type with the specified name.
|
static GlobalAsymmetricGrammar.Nonterminal[] |
GlobalAsymmetricGrammar.Nonterminal.values()
Returns an array containing the constants of this enum type, in
the order they are declared.
|
Modifier and Type | Method and Description |
---|---|
EnumSet<GlobalAsymmetricGrammar.Nonterminal> |
GlobalAsymmetricGrammar.getAccepting() |
Class<GlobalAsymmetricGrammar.Nonterminal> |
GlobalAsymmetricGrammar.getNonterminalClass() |
ArrayList<ProductionRule<GlobalAsymmetricGrammar.Nonterminal>> |
GlobalAsymmetricGrammar.getPossibleRules(GlobalAsymmetricGrammar.Nonterminal nonterminal,
int leftSize,
int rightSize,
int M,
int N) |
Modifier and Type | Method and Description |
---|---|
ArrayList<ProductionRule<GlobalAsymmetricGrammar.Nonterminal>> |
GlobalAsymmetricGrammar.getPossibleRules(GlobalAsymmetricGrammar.Nonterminal nonterminal,
int leftSize,
int rightSize,
int M,
int N) |
Copyright (C) 2016 Benjamin Paaßen, 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 . This documentation is licensed under the conditions of CC-BY-SA 4.0: https://creativecommons.org/licenses/by-sa/4.0/