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 |
---|---|
AffineGrammar.Nonterminal[] |
AffineGrammar.dependencySort()
Returns the nonterminals of this grammar sorted according to their
dependencies on one another.
|
AffineGrammar.Nonterminal |
AffineGrammar.getAxiom()
Returns the axiom of this grammar.
|
static AffineGrammar.Nonterminal |
AffineGrammar.Nonterminal.valueOf(String name)
Returns the enum constant of this type with the specified name.
|
static AffineGrammar.Nonterminal[] |
AffineGrammar.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<AffineGrammar.Nonterminal> |
AffineGrammar.getAccepting()
Returns the set of all accepting nonterminals of this grammar.
|
Class<AffineGrammar.Nonterminal> |
AffineGrammar.getNonterminalClass()
Returns the enum class that lists the nonterminal symbols of
this grammar.
|
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.
|
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.
|
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