A decomposition-based Persian KGQA method and a new 5,600-question decomposition dataset improve F1 from 62.98% to 75.55% on PeCoQ.
Enhancing Complex Question Answering over Knowledge Graphs through Evidence Pattern Retrieval
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Information retrieval (IR) methods for KGQA consist of two stages: subgraph extraction and answer reasoning. We argue current subgraph extraction methods underestimate the importance of structural dependencies among evidence facts. We propose Evidence Pattern Retrieval (EPR) to explicitly model the structural dependencies during subgraph extraction. We implement EPR by indexing the atomic adjacency pattern of resource pairs. Given a question, we perform dense retrieval to obtain atomic patterns formed by resource pairs. We then enumerate their combinations to construct candidate evidence patterns. These evidence patterns are scored using a neural model, and the best one is selected to extract a subgraph for downstream answer reasoning. Experimental results demonstrate that the EPR-based approach has significantly improved the F1 scores of IR-KGQA methods by over 10 points on ComplexWebQuestions and achieves competitive performance on WebQuestionsSP.
citation-role summary
citation-polarity summary
fields
cs.IR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Method for Multi-Hop Question Answering on Persian Knowledge Graph
A decomposition-based Persian KGQA method and a new 5,600-question decomposition dataset improve F1 from 62.98% to 75.55% on PeCoQ.