4 This tree edit distance operates on ordered trees with node (but not edge) labels, hence it is suited for delexicalised dependencies.
it is defined over a map M , which is a list of node pairs where the former belongs to S or (empty node), and the latter belongs to T or .