Nlp 斯坦福语法分析器:依赖关系可以转换为语法树吗?
是否有一种摆脱依赖关系的方法:Nlp 斯坦福语法分析器:依赖关系可以转换为语法树吗?,nlp,stanford-nlp,nlg,Nlp,Stanford Nlp,Nlg,是否有一种摆脱依赖关系的方法: nmod:poss(dog-2, My-1) nsubj(likes-4, dog-2) advmod(likes-4, also-3) root(ROOT-0, likes-4) xcomp(likes-4, eating-5) dobj(eating-5, sausage-6) 到相应的解析树 (ROOT (S (NP (PRP$ My) (NN dog)) (ADVP (RB also)) (VP (VBZ likes)
nmod:poss(dog-2, My-1)
nsubj(likes-4, dog-2)
advmod(likes-4, also-3)
root(ROOT-0, likes-4)
xcomp(likes-4, eating-5)
dobj(eating-5, sausage-6)
到相应的解析树
(ROOT
(S
(NP (PRP$ My) (NN dog))
(ADVP (RB also))
(VP (VBZ likes)
(S
(VP (VBG eating)
(NP (NN sausage)))))
(. .)))
据我所知,你只能从另一个方向翻译