Package | Description |
---|---|
de.citec.tcs.alignment.trees |
This package contains an implementation of the Tree Edit Distance according to Zhang & Shasha (1989).
|
Modifier and Type | Class and Description |
---|---|
class |
TreeEditCooptimalAlgorithm<X,Y>
Computes the CooptimalMatrix for the tree edit distance between X and Y.
|
class |
TreeEditFullAlgorithm<X,Y>
Computes the Alignment between nodes in X and Y such that the edit cost of the corresponding
edit script is minimized, i.e. returns the Alignment which corresponds to the tree edit
distance.
|
class |
TreeEditScoreAlgorithm<X,Y>
Computes the tree edit distance between two input trees.
|
class |
TreeEditSoftAlgorithm<X,Y>
This algorithm computes a generalization of a CooptimalMatrix by considering not only the optimal
edit script between the two input trees, but in each step of the computation considers an
operation with the weight exp(-β · δ) where δ is the difference between
the cost of the operation and the optimal cost and β is a hyper-parameter called
'crispness' (see below).
|
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/