Working with syntax trees

[Daniël de Kok]

On Oct 28, 2011, at 4:36 PM, dokondr wrote:
> I also need to devise some general metric that will allow me to estimate distance between any two graphs. This distance should account both for structural and leaf-node values similarity.

If the graph is a tree, you can use one of the very many tree edit distance algorithms. Bille, 2005, provides an overview of such algorithms.

Eelco Lempsink's thesis may also be of interest:

http://eelco.lempsink.nl/thesis.pdf

-- Daniel