X
- the class of the elements in the left input sequence.Y
- the class of the elements in the right input sequence.R
- the result class that represents the alignment in some way.public interface TreeEditAlgorithm<X,Y,R>
Modifier and Type | Method and Description |
---|---|
R |
calculateAlignment(Tree<X> x,
Tree<Y> y)
This calculates the tree edit distance D between the trees x ∈ T(X) and y ∈
T(Y) and returns it as an instance of the result class for this algorithm.
|
Comparator<Tree<X>,Tree<Y>> |
getComparator()
This should return the Comparator d used to compute the operation costs for this
TreeEditAlgorithm.
|
Class<R> |
getResultClass()
This method shall return the class of the edit distance result.
|
boolean |
requires(OperationType type)
This method should return true if and only if this AlignmentAlgorithm uses the given
operation.
|
void |
setComparator(Comparator<Tree<X>,Tree<Y>> comparator)
This should set the Comparator used to compute the operation costs for this
TreeEditAlgorithm.
|
Comparator<Tree<X>,Tree<Y>> getComparator()
void setComparator(@NonNull Comparator<Tree<X>,Tree<Y>> comparator)
comparator
- the comparator that is used to compute the operation costs for this
TreeEditAlgorithm.R calculateAlignment(Tree<X> x, Tree<Y> y)
x
- The left input tree (may be null if the tree is empty).y
- The right input tree (may be null if the tree is empty).Class<R> getResultClass()
boolean requires(OperationType type)
type
- an OperationType.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/