Hi PerlMonks,
I think that my problem is a rather trivial one for you perl gurus: I want to find the depth of a parse tree for natural language. I have filtered out the relevant features regarding the tree relations into a list of the following form:
1 -> 2
2 -> 0
3 -> 4
4 -> 2
5 -> 10
6 -> 10
7 -> 9
8 -> 9
9 -> 6
10 -> 4
11 -> 10
12 -> 10
13 -> 12
14 -> 10
15 -> 2
where the left (dependent) value points to the ancestor node. When all the nodes are traversed, I want to how many steps (or branches) there are between the root (0) and the most distant leaf. Any suggestions? I would be so grateful! Thanks in advance
Katarina