Anonymous Monk has asked for the wisdom of the Perl Monks concerning the following question:
while i want to convert it to tree structure and then mainly use post order traversal for implementing TED algorithms. so i prefer something more convinient for labeling the nodes and finding the key nodes of the tree and/or comparing them and what so ever. All your suggestions is really appreciated. Best Regards and thanks in advance ...(ROOT (S (NP (DT this)) (VP (VBZ is) (ADVP (RB just)) (NP (DT a) (NN test))) (. .)))
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: PERL and TREE
by Fletch (Bishop) on Feb 11, 2009 at 13:15 UTC | |
|
Re: PERL and TREE
by dHarry (Abbot) on Feb 11, 2009 at 12:32 UTC | |
by Anonymous Monk on Feb 11, 2009 at 12:43 UTC | |
|
Re: PERL and TREE
by ELISHEVA (Prior) on Feb 11, 2009 at 14:17 UTC | |
by Anonymous Monk on Feb 11, 2009 at 14:32 UTC |