N
- the enum listing the nonterminal symbols for the input grammar.public class SparseStrictADPScoreAlgorithm<N extends Enum<N>> extends SparseAbstractADPAlgorithm<Double,N>
Constructor and Description |
---|
SparseStrictADPScoreAlgorithm(SparseGrammar<N> grammar,
AlignmentSpecification alignmentSpecification) |
Modifier and Type | Method and Description |
---|---|
double |
choice(double[] choices)
This should implement the choice function as the term is used
in the Bellman's Gap context.
|
Double |
transformToResult(EnumMap<N,HashMap<MatrixEngine.MatrixCoordinate,Double>> dpTables,
HashMap<MatrixEngine.MatrixCoordinate,Double> compareMatrix,
double[] deletionMatrix,
double[] insertionMatrix,
double[] skipDeletionMatrix,
double[] skipInsertionMatrix,
Sequence a,
Sequence b)
This method should not be called from outside!
The subclass uses this method to transform the alignment matrix and the
input sequences to the actual alignment result.
|
calculateAlignment, getGrammar, getResultClass, getSpecification, getWeightThreshold, setWeightThreshold
public SparseStrictADPScoreAlgorithm(SparseGrammar<N> grammar, AlignmentSpecification alignmentSpecification)
public double choice(double[] choices)
public Double transformToResult(EnumMap<N,HashMap<MatrixEngine.MatrixCoordinate,Double>> dpTables, HashMap<MatrixEngine.MatrixCoordinate,Double> compareMatrix, double[] deletionMatrix, double[] insertionMatrix, double[] skipDeletionMatrix, double[] skipInsertionMatrix, Sequence a, Sequence b)
transformToResult
in class SparseAbstractADPAlgorithm<Double,N extends Enum<N>>
dpTables
- the dynamic programming matrices used during
calculation.compareMatrix
- the local cost for replacing node i from the first
sequence with node j from the second sequence.deletionMatrix
- the local cost for deleting node i from the first
sequence.insertionMatrix
- the local cost for inserting node j from the
second sequence into the first sequence.skipDeletionMatrix
- the local cost for skipping node i in the
first sequence.skipInsertionMatrix
- the local cost for skipping node j in the
second sequence.a
- the first sequence.b
- th second sequence.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 . This documentation is licensed under the conditions of CC-BY-SA 4.0: https://creativecommons.org/licenses/by-sa/4.0/