Package | Description |
---|---|
de.unibi.citec.tcs.alignment.comparators |
This package contains comparators that define distances between Values.
|
Modifier and Type | Method and Description |
---|---|
double |
ReplacementComparator.calculateLocalDerivative(int paramIdx,
SymbolicValue a,
SymbolicValue b,
OperationType type)
This is called by an AlignmentDerivativeAlgorithm and should calculate
the local derivative for only one comparison of the values a and b.
|
double |
TrivialEditComparator.calculateLocalDerivative(int paramIdent,
SymbolicValue a,
SymbolicValue b,
OperationType type)
This is called by an AlignmentDerivativeAlgorithm and should calculate
the local derivative for only one comparison of the values a and b.
|
SparseLocalDerivative |
ReplacementComparator.calculateSparseLocalDerivative(SymbolicValue a,
SymbolicValue b,
OperationType type)
This method shall return a sparse representation of the derivative for
all parameters that have non-zero derivatives in this step of the
alignment.
|
SparseLocalDerivative |
TrivialEditComparator.calculateSparseLocalDerivative(SymbolicValue a,
SymbolicValue b,
OperationType type)
This method shall return a sparse representation of the derivative for
all parameters that have non-zero derivatives in this step of the
alignment.
|
double |
ReplacementComparator.compare(SymbolicValue a,
SymbolicValue b)
This has to return a distance between a and b with the following
restrictions:
The return value has to lie between 0 and 1.
1 means maximum dissimilarity between a and b.
0 means maximum similarity between a and b (especially it should be
true that a = b implies a zero distance).
distance(a,b) should be equal or at least close to
distance(b,a)
Please note that this has to be well-defined, even if an input is null.
|
double |
TrivialEditComparator.compare(SymbolicValue a,
SymbolicValue b)
This has to return a distance between a and b with the following
restrictions:
The return value has to lie between 0 and 1.
1 means maximum dissimilarity between a and b.
0 means maximum similarity between a and b (especially it should be
true that a = b implies a zero distance).
distance(a,b) should be equal or at least close to
distance(b,a)
Please note that this has to be well-defined, even if an input is null.
|
double |
ReplacementComparator.delete(SymbolicValue a)
This should be called during an alignment to retrieve the costs for a
deletion of value a from the first sequence.
|
double |
TrivialEditComparator.delete(SymbolicValue a)
This should be called during an alignment to retrieve the costs for a
deletion of value a from the first sequence.
|
double |
ReplacementComparator.insert(SymbolicValue b)
This should be called during an alignment to retrieve the costs for an
insertion of value b into the first sequence.
|
double |
TrivialEditComparator.insert(SymbolicValue b)
This should be called during an alignment to retrieve the costs for an
insertion of value b into the first sequence.
|
double |
ReplacementComparator.skipDelete(SymbolicValue a)
This should be called during an alignment to retrieve the costs for a
skip deletion of value a from the first sequence.
|
double |
TrivialEditComparator.skipDelete(SymbolicValue a)
This should be called during an alignment to retrieve the costs for a
skip deletion of value a from the first sequence.
|
double |
ReplacementComparator.skipInsert(SymbolicValue b)
This should be called during an alignment to retrieve the costs for a
skip insertion of value b into the first sequence.
|
double |
TrivialEditComparator.skipInsert(SymbolicValue b)
This should be called during an alignment to retrieve the costs for a
skip insertion of value b into the first sequence.
|
Copyright © 2014. All rights reserved.