X
- The node class for the left input forest.Y
- The node class for the right input forest.public class OrderedForestSoftAlgorithm<X,Y> extends AbstractForestAlgorithm<X,Y,CooptimalMatrix>
Constructor and Description |
---|
OrderedForestSoftAlgorithm(Comparator<Tree<X>,Tree<Y>> comparator) |
Modifier and Type | Method and Description |
---|---|
Class<CooptimalMatrix> |
getResultClass()
This method shall return the class of the alignment result.
|
void |
setComparator(Comparator<Tree<X>,Tree<Y>> comparator)
This should set the Comparator used to compute local distances for this algorithm.
|
void |
setCrispness(double crispness) |
CooptimalMatrix<Tree<X>,Tree<Y>> |
transformToResult(double[][] rep,
double[] del,
double[] ins,
List<Tree<X>> X,
List<Tree<Y>> Y)
Transforms the pairwise tree edit distances between the trees in the left and right forest to
an overall forest edit distance.
|
calculateAlignment, getComparator, requires
public OrderedForestSoftAlgorithm(Comparator<Tree<X>,Tree<Y>> comparator)
public void setComparator(Comparator<Tree<X>,Tree<Y>> comparator)
AlignmentAlgorithm
setComparator
in interface AlignmentAlgorithm<Tree<X>,Tree<Y>,CooptimalMatrix>
setComparator
in class AbstractForestAlgorithm<X,Y,CooptimalMatrix>
comparator
- the comparator that is used to compute local distances for this Algorithm.public void setCrispness(double crispness)
crispness
- The crispness parameter β. A high value means that the result will be
almost indistinguishable from the TreeEditCooptimalAlgorithm. A value around 0 means that
all possible alignments between the input trees are weighed equally.public CooptimalMatrix<Tree<X>,Tree<Y>> transformToResult(double[][] rep, double[] del, double[] ins, List<Tree<X>> X, List<Tree<Y>> Y)
AbstractForestAlgorithm
transformToResult
in class AbstractForestAlgorithm<X,Y,CooptimalMatrix>
rep
- the pairwise edit distance costs.del
- the deletion costs for all trees in the left forest.ins
- the insertion costs for all trees in the right forest.X
- the left input forest.Y
- the right input forest.public Class<CooptimalMatrix> getResultClass()
AlignmentAlgorithm
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/