Korakot Chaovavanich

Here's how I try to filter out sentences with multple roots/ROOTs. From 5076 total, only 3411 are left. https://colab.research.google.com/drive/1IMhJOKqpZvrxfje73WgOk9P6vO7_eGiy

It's possible in theory. A constituency tree can be converted to a dependency tree with no ambiguity. For example VP = V + NP can be converted to V -[dobj]->...

For S = NP + VP It needs to look inside of NP and VP, so that we can know which [rel] it is. It's not ambiguous, though. You need...