find all pairs of adjacent subtrees (rooted in specific nonterminal) of a parse tree

[Tatiana Gaponova]

How can I efficiently list all pairs of subtrees (rooted in specific nonterminal) of a parse tree? For example, I have the following tree:

(S (S (S (S (X (PRO pro))) (X (V v))) (X (ADJ adj))) (X (N n)))

You can see the image on this link.

I want to list all adjacent instances of the symbol X expanding to other symbols, i. e.:

1. (X (PRO pro)) and (X (V v))
2. (X (V v)) and (X (ADJ adj))
3. (X (ADJ adj)) and (X (N n))

[Raúl Speroni]

Hi, could yo solve this? im facing a similar problem. 

thanks!

[Steven Bird]

I recommend using the new tgrep module recently added to NLTK (install the latest version from GitHub), and once you've identified the nodes of interest, generate all pairs of subtrees using nested iteration.

--
You received this message because you are subscribed to the Google Groups "nltk-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to nltk-users+...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.