One measure of similarity between AMR and DG graphs is the configuration of the most complex subgraph alignment between them.
configuration a:b is higher than c:d if a + b > c + d. all configurations involving 0 are lower than those which do not.