X
- The node class for the left input forest.Y
- The node class for the right input forest.public class OrderedForestScoreAlgorithm<X,Y> extends AbstractForestAlgorithm<X,Y,Double>
Constructor and Description |
---|
OrderedForestScoreAlgorithm(Comparator<Tree<X>,Tree<Y>> comparator) |
Modifier and Type | Method and Description |
---|---|
Class<Double> |
getResultClass()
This method shall return the class of the alignment result.
|
Double |
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.
|
static <X,Y> int |
worstCaseDistance(List<Tree<X>> X,
List<Tree<Y>> Y)
Returns the worst possible distance between the two input forests.
|
calculateAlignment, getComparator, requires, setComparator
public OrderedForestScoreAlgorithm(Comparator<Tree<X>,Tree<Y>> comparator)
public Double transformToResult(double[][] rep, double[] del, double[] ins, List<Tree<X>> X, List<Tree<Y>> Y)
AbstractForestAlgorithm
transformToResult
in class AbstractForestAlgorithm<X,Y,Double>
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<Double> getResultClass()
AlignmentAlgorithm
public static <X,Y> int worstCaseDistance(@NonNull List<Tree<X>> X, @NonNull List<Tree<Y>> Y)
X
- the class of elements in the first input forest.Y
- the class of elements in the second input forest.X
- the left forestY
- the right forestCopyright (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/