X
- the node class for the left input.Y
- the node class for the right input.public class LabelComparator<X,Y> extends Object implements Comparator<Tree<X>,Tree<Y>>
Constructor and Description |
---|
LabelComparator(Comparator<X,Y> comp)
Creates a new LabelComparator.
|
Modifier and Type | Method and Description |
---|---|
double |
compare(OperationType type,
Tree<X> a,
Tree<Y> b)
This method returns a dissimilarity between x and y using the alignment operation op with the
following restrictions:
compare(op,x,y) ≥ 0 (non-negativity)
compare(op,x,y) ≤ 1 (normalization)
x = y ⇒ compare(op,x,y) = 0 (equality)
Further, this function guarantees consistency with respect to null inputs, that is, for any
operation op ∈ {REPLACEMENT, DELETIONREPLACEMENT, INSERTIONREPLACEMENT} it holds:
d(op, x, null) = d(DELETION, x, null)
d(op, null, y) = d(INSERTION, null, y)
and for any operation it holds:
d(op, null, null) = 0
Please note that a and b might be null if this alignment uses gaps or
skips.
|
boolean |
hasCoherentReplacementCost()
This method should return true if and only if this Comparator guarantees that
compare(OperationType.REPLACEMENT, x, y) =
compare(OperationType.DELETIONREPLACEMENT, x, y) =
compare(OperationType.INSERTIONREPLACEMENT, x, y)
for all possible inputs x, y.
|
boolean |
supports(OperationType type)
This method should return true if and only if this Comparator supports the given alignment
operation.
|
public LabelComparator(@NonNull Comparator<X,Y> comp)
comp
- the nested comparator which defines the distance between labels.public double compare(@NonNull OperationType type, Tree<X> a, Tree<Y> b)
Comparator
public boolean supports(OperationType type)
Comparator
public boolean hasCoherentReplacementCost()
Comparator
hasCoherentReplacementCost
in interface Comparator<Tree<X>,Tree<Y>>
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/