Understanding natural language questions entails the ability to break down a question into the requisite steps for computing its answer. In this work, we introduce a Question Decomposition Meaning Representation (QDMR) for questions. QDMR constitutes the ordered list of steps, expressed through natural language, that are necessary for answering a question. We develop a crowdsourcing pipeline, showing that quality QDMRs can be annotated at scale, and release the BREAK dataset, containing over 83K pairs of questions and their QDMRs. We demonstrate the utility of QDMR by showing that (a) it can be used to improve open-domain question answering on the HOTPOTQA dataset, (b) it can be deterministically converted to a pseudo-SQL formal language, which can alleviate annotation in semantic parsing applications. Last, we use BREAK to train a sequenceto-sequence model with copying that parses questions into QDMR structures, and show that it substantially outperforms several natural baselines. QDMR NL Question Decomposition 1. Shayne Graham 2. field goals of #1 3. yards of #2 4. number of #2 for each #3 5. #3 where #4 is two 1. papers 2. #1 in ACL 3. keywords of #2 4. number of #2 for each #3 5. #3 where #4 is more than 100 select[papers] filter[ACL] project[keywords] group[count] comparative[> ,100] select[Shayne Graham] project[field goals] project[yards] group[count] comparative[= ,two] select[objects] project[colors] group[count] superlative[max] QDMR NL
Most recently, REF introduce a Question Decomposition Meaning Representation (QDMR) for questions and release the BREAK dataset.
Break It Down: A Question Understanding Benchmark
ArXiv
ArXiv
Computer Science