2017-04-04 107 views
0

有沒有辦法從依賴到去:斯坦福解析器:可以將依賴關係轉換爲解析樹嗎?

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))))) 
    (. .))) 

回答