i have a phrase in the format "Word_POS-TAG_Lemma Word_POS-TAG_Lemma Word_POS-TAG_Lemma Word_POS-TAG_Lemma....." is there a way to feed the stanford parser with this kind of formatted input? Moreover these is a way to obtain a tree in the standard dependencies way?i have a phrase in the format "Word_POS-TAG_Lem