Corpus ID: 233297028

Question Decomposition with Dependency Graphs

@article{Hasson2021QuestionDW,
  title={Question Decomposition with Dependency Graphs},
  author={Matan Hasson and Jonathan Berant},
  journal={ArXiv},
  year={2021},
  volume={abs/2104.08647}
}
QDMR is a meaning representation for complex questions, which decomposes questions into a sequence of atomic steps. While stateof-the-art QDMR parsers use the common sequence-to-sequence (seq2seq) approach, a QDMR structure fundamentally describes labeled relations between spans in the input question, and thus dependency-based approaches seem appropriate for this task. In this work, we present a QDMR parser that is based on dependency graphs (DGs), where nodes in the graph are words and edges… Expand

References

SHOWING 1-10 OF 27 REFERENCES
Break It Down: A Question Understanding Benchmark
Compositional Semantic Parsing on Semi-Structured Tables
The Web as a Knowledge-base for Answering Complex Questions
GQA: A New Dataset for Real-World Visual Reasoning and Compositional Question Answering
HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering
HybridQA: A Dataset of Multi-Hop Question Answering over Tabular and Textual Data
Incorporating Copying Mechanism in Sequence-to-Sequence Learning
Constructing Datasets for Multi-hop Reading Comprehension Across Documents
...
1
2
3
...