Parsing Universal Dependencies without training
conference of the european chapter of the association for computational linguistics, Volume abs/1701.03163, 2017.
We propose UDP, the first training-free parser for Universal Dependencies (UD). Our algorithm is based on PageRank and a small set of head attachment rules. It features two-step decoding to guarantee that function words are attached as leaf nodes. The parser requires no training, and it is competitive with a delexicalized transfer system....More
PPT (Upload PPT)