1 code implementation • AKBC 2021 • Matan Hasson, Jonathan Berant
In this work, we present a QDMR parser that is based on dependency graphs (DGs), where nodes in the graph are words and edges describe logical relations that correspond to the different computation steps.
