| Challenge: | a new model for compositional questions is needed to answer multi-step reasoning . the model is inspired by formal approaches to compositional semantics . |
| Approach: | They propose an end-to-end differentiable model for interpreting compositional questions . they build a latent tree of interpretable expressions over a sentence . |
| Outcome: | The proposed model outperforms RNN encoders when test questions are longer than training questions. |
Similar Papers
Grounded Graph Decoding improves Compositional Generalization in Question Answering (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Current compositional generalization models lose syntax context when learning a flat input . a new method to improve compositional globalization is proposed to ground structured predictions with an attention mechanism. |
| Approach: | They propose a method to ground structured predictions by a structure-based attention mechanism. |
| Outcome: | The proposed method performs competitively on the Compositional Freebase Questions dataset. |
End-to-End Entity Resolution and Question Answering Using Differentiable Knowledge Graphs (2021.emnlp-main)
Copied to clipboard
| Challenge: | End-to-end (E2E) trained models for question answering over knowledge graphs (KGQA) are effective, but training a weakly supervised dataset is difficult. |
| Approach: | They extend the boundaries of E2E learning for KGQA to include the training of an ER component. |
| Outcome: | The proposed model is fully differentiable thanks to a recent method for building differentiably KGs. |
Compositional Semantic Parsing across Graphbanks (P19-1)
Copied to clipboard
| Challenge: | Existing semantic parsers that map sentences to graph-based meaning representations are hand-designed for specific graphbanks. |
| Approach: | They propose a compositional neural semantic parser which achieves competitive accuracies across graphbanks. |
| Outcome: | The proposed system achieves competitive accuracies across a variety of graphbanks. |
Latent Compositional Representations Improve Systematic Generalization in Grounded Question Answering (2021.tacl-1)
Copied to clipboard
| Challenge: | Neural networks fail to generalize to out-of-distribution examples that contain new compositions. |
| Approach: | They propose a model that computes a representation and denotation for all question spans in a bottom-up, compositional manner using a CKY-style parser. |
| Outcome: | The proposed model achieves 96.1% accuracy on a challenging dataset compared to baseline models on . previous models failed to generalize to out-of-distribution examples . |
Compositional Generalization with Grounded Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for combining language models with knowledge graphs struggle with generalization to sequences of unseen lengths and novel combinations of seen base components. |
| Approach: | They propose a procedure for generating natural language questions paired with knowledge graphs that targets different aspects of compositionality and avoids grounding models in information already encoded in their weights. |
| Outcome: | The proposed method fails to generalize to unseen lengths and to novel combinations of seen base components. |
Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering (C18-1)
Copied to clipboard
| Challenge: | Existing approaches to Knowledge Base Question Answering focus on semantic parsing . previous work focused on selecting the correct semantic relations and not on the structure of the semantic parses . |
| Approach: | They propose to use Gated Graph Neural Networks to encode the graph structure of the semantic parse. |
| Outcome: | The proposed approach outperforms baseline models that do not explicitly model the structure. |
Compositional Generalization via Semantic Tagging (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing neural sequence-to-sequence models fail at compositional generalization, i.e., they cannot generalize to unseen compositions of seen components. |
| Approach: | They propose a decoding framework that preserves expressivity and generality of sequence-to-sequence models while featuring lexicon-style alignments and disentangled information processing. |
| Outcome: | The proposed framework improves compositional generalization across model architectures, domains, and semantic formalisms on three semantic parsing datasets. |
Compositional Generalisation with Structured Reordering and Fertility Layers (2023.eacl-main)
Copied to clipboard
| Challenge: | Seq2seq models struggle with compositional generalisation, i.e. generalising to new and potentially more complex structures than seen during training. |
| Approach: | They propose a flexible end-to-end differentiable neural model that composes two structural operations: a fertility step and a reordering step. |
| Outcome: | The proposed model outperforms seq2seq models on compositional splits of realistic semantic parsing tasks. |
The Mystery of Compositional Generalization in Graph-based Generative Commonsense Reasoning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies have found that LLMs are limited in scenarios that require generalization abilities, such as out-of-domain tasks. |
| Approach: | They propose a Compositional Generalization Challenge for Graph-based Commonsense Reasoning that requires models to generate a natural sentence based on given concepts and a reasoning graph. |
| Outcome: | The proposed framework is based on seven well-known LLMs and shows that they struggle in compositional generalization. |
From Phrases to Subgraphs: Fine-Grained Semantic Parsing for Knowledge Graph Question Answering (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to knowledge graph question answering (KGQA) face semantic misalignment and reasoning noise. |
| Approach: | They propose a fine-grained semantic parsing framework for KGQA that maps natural language queries to executable logical forms. |
| Outcome: | The proposed framework achieves 18.5% performance improvement over the SOTA on a multi-hop CWQ dataset. |