上下文无关文法树作为功能

Question

有没有办法将StanfordParser的输出用作模型的功能？ StanfordParser的输出如下所示： 句子：“你好吗？”

Result - [Tree('ROOT', [Tree('SBARQ', [Tree('WHADVP', [Tree('RB', ['hello']), Tree('WRB', ['how'])]), Tree('SQ', [Tree('VBP', ['are']), Tree('NP', [Tree('PRP', ['you'])])]), Tree('.', ['?'])])])]

Result[0] - (ROOT (SBARQ
(WHADVP (RB hello) (WRB how))
(SQ (VBP are) (NP (PRP you)))
(. ?)))