Yiheng Shu, Yuzhong Qu, Sitao Cheng, Xiang Huang, Yuheng Bao
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Knowledge base question answering (KBQA) has attracted a lot of interest in recent years, especially for complex questions which require multiple facts to answer. Question decomposition is a promising way to answer complex questions. Existing decomposition methods split the question into sub-questions according to a single compositionality type, which is not sufficient for questions involving multiple compositionality types. In this paper, we propose Question Decomposition Tree (QDT) to represent the structure of complex questions. Inspired by recent advances in natural language generation (NLG), we present a two-staged method called Clue-Decipher to generate QDT. It can leverage the strong ability of NLG model and simultaneously preserve the original questions. To verify that QDT can enhance KBQA task, we design a decomposition-based KBQA system called QDTQA. Extensive experiments show that QDTQA outperforms previous state-of-the-art methods on ComplexWe-bQuestions dataset. Besides, our decomposition method improves an existing KBQA system by 11% and sets a new state-of-the-art on LC-QuAD 1.0.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2306.07597")
get_code_for_paper("2306.07597")
have("2306.07597")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2306.07597.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2306.07597)
Connect an agent — have() is free.