Designing and interpreting probes with control tasks

J Hewitt, P Liang - ar** from transition-based parsing algorithms that read sentences from left
to right to sequence labeling encodings of syntactic trees. This not only establishes a …

Parsing as tagging

R Vacareanu, GCG Barbosa… - Proceedings of the …, 2020 - aclanthology.org
We propose a simple yet accurate method for dependency parsing that treats parsing as
tagging (PaT). That is, our approach addresses the parsing of dependency trees with a …

A transition-based algorithm for unrestricted AMR parsing

D Vilares, C Gómez-Rodríguez - arxiv preprint arxiv:1805.09007, 2018 - arxiv.org
Non-projective parsing can be useful to handle cycles and reentrancy in AMR graphs. We
explore this idea and introduce a greedy left-to-right non-projective transition-based parser …

Non-projective dependency parsing with non-local transitions

D Fernández-González… - arxiv preprint arxiv …, 2017 - arxiv.org
We present a novel transition system, based on the Covington non-projective parser,
introducing non-local transitions that can directly create arcs involving nodes to the left of the …

Scene graph parsing by attention graph

M Andrews, YK Chia, S Witteveen - arxiv preprint arxiv:1909.06273, 2019 - arxiv.org
Scene graph representations, which form a graph of visual object nodes together with their
attributes and relations, have proved useful across a variety of vision and language …