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))) (. .)))
In reply to PERL and TREE by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |