X
- the class of the elements in the left input sequence.Y
- the class of the elements in the right input sequence.N
- the enum listing the nonterminal symbols for the input grammar.public class SparseStrictADPFullAlgorithm<X,Y,N extends Enum<N>> extends SparseAbstractADPAlgorithm<X,Y,Alignment,N>
SparseAbstractADPAlgorithm.SparseMatrix
Constructor and Description |
---|
SparseStrictADPFullAlgorithm(SparseGrammar<N> grammar,
Comparator<X,Y> comparator) |
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.
|
Alignment<X,Y> |
transformToResult(EnumMap<N,SparseAbstractADPAlgorithm.SparseMatrix> dpTables,
EnumMap<OperationType,SparseAbstractADPAlgorithm.SparseMatrix> repMatrices,
EnumMap<OperationType,double[]> delVectors,
EnumMap<OperationType,double[]> insVectors,
List<X> a,
List<Y> b)
This method should not be called from outside!
|
calculateAlignment, getComparator, getResultClass, normalizeDissimilarity, requires, setComparator
public SparseStrictADPFullAlgorithm(@NonNull SparseGrammar<N> grammar, @NonNull Comparator<X,Y> comparator)
public double choice(double[] choices)
SparseAbstractADPAlgorithm
public Alignment<X,Y> transformToResult(@NonNull EnumMap<N,SparseAbstractADPAlgorithm.SparseMatrix> dpTables, @NonNull EnumMap<OperationType,SparseAbstractADPAlgorithm.SparseMatrix> repMatrices, @NonNull EnumMap<OperationType,double[]> delVectors, @NonNull EnumMap<OperationType,double[]> insVectors, @NonNull List<X> a, @NonNull List<Y> b)
SparseAbstractADPAlgorithm
transformToResult
in class SparseAbstractADPAlgorithm<X,Y,Alignment,N extends Enum<N>>
dpTables
- the dynamic programming matrices used during calculation.repMatrices
- the local cost for replacing node i from the first sequence with node j
from the second sequence.delVectors
- the local cost for deleting node i from the first sequence.insVectors
- the local cost for inserting node j from the second sequence into the first
sequence.a
- the first sequence.b
- th second sequence.Copyright (C) 2016-2018 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/