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.
|
Class and Description |
---|
AbstractADPAlgorithm
This is the most abstract ADP algorithm just implementing the
forward calculation of the dynamic programming tables for an
arbitrary grammar.
|
AffineGrammar.Nonterminal
These are the nonterminal symbols for the affine grammar.
|
DPCellId
This identifies a cell in the dynamic programming tables by the ordinal of
the nonterminal symbol, the index in the left sequence (i) and the index
in the right sequence (j).
|
GlobalAsymmetricGrammar.Nonterminal |
GlobalGrammar.Nonterminal |
Grammar
An Algebraic Dynamic Programming (ADP) grammar is a regular tree
grammar.
|
ProductionRule
A ProductionRule actually represents the right hand side of a
production rule in an ADP grammar.
|
SoftADPPathModel
This is basically a large storage class for all results of a
SoftADPFullAlgorithm to facilitate derivative calculation.
|
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