Injecting Relational Structural Representation in Neural Networks for Question Similarity (P18-2)
Copied to clipboard
| Challenge: | Recent years have seen exponential growth and use of web forums, where users can exchange and find information just asking questions in natural language. |
| Approach: | They propose to use Tree Kernels to learn a model on relatively few pairs of questions as gold standard (GS) predicting labels on a very large corpus of question pairs is also a useful approach, they propose . |
| Outcome: | The proposed model can learn more accurate models after fine tuning on GS. |
Similar Papers
Exploiting the Syntax-Model Consistency for Neural Relation Extraction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing deep learning models for Relation Extraction (RE) have limited generalization beyond the syntactic structures of the input sentences. |
| Approach: | They propose a deep learning model that uses dependency trees to extract syntactic importance of words for Relation Extraction. |
| Outcome: | The proposed model outperforms existing models on three RE benchmark datasets. |
Large-Scale Relation Learning for Question Answering over Knowledge Bases with Pre-trained Language Models (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing KBQA methods focus on the natural language but ignore textual information carried by the nodes and edges. |
| Approach: | They propose to perform relation extraction, relation matching, and relation reasoning tasks to align the natural language expressions to the relations in the KB and reason over the missing connections. |
| Outcome: | Experiments on WebQSP show that the proposed model outperforms baselines even when the KB is incomplete. |
Simple and Effective Semi-Supervised Question Answering (N18-2)
Copied to clipboard
| Challenge: | Existing deep learning systems for extractive Question Answering are limited and expensive to construct. |
| Approach: | They propose a semi-supervised QA system where end user specifies a set of documents and only a few labelled examples. |
| Outcome: | The proposed system achieves 50% F1 score on SQuAD and TriviaQA with very little labeled data. |
DuoRAT: Towards Simpler Text-to-SQL Models (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent text-to-SQL models can translate natural language questions to corresponding SQL queries on unseen databases. |
| Approach: | They propose a re-implementation of the RAT-SQL model that uses only relation-aware or vanilla transformers as the building blocks. |
| Outcome: | The proposed model is based on the spider dataset and shows it can be used on large databases without human intervention. |
Structural generalization in COGS: Supertagging is (almost) all you need (2023.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have shown that neural networks fail to generalize on out-of-distribution examples. |
| Approach: | They extend a neural graph-based parsing framework to address compositional generalization limitations . they introduce a supertagging step with valency constraints and reduce the graph prediction problem . |
| Outcome: | The proposed approach improves results on COGS datasets that require structural generalization. |
Relation Extraction with Word Graphs from N-grams (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies for relation extraction (RE) leverage the dependency tree of the input sentence to improve performance. |
| Approach: | They propose to use a graph convolutional network to build a context graph without dependency parsers. |
| Outcome: | The proposed approach improves neural RE methods without dependency parsers on English benchmark datasets. |
Global Reasoning over Database Structures for Text-to-SQL Parsing (D19-1)
Copied to clipboard
| Challenge: | Existing semantic parsers only select a set of database constants at training time . current models only consider local information, not global ones . |
| Approach: | They propose a semantic parser that globally reasons about the structure of the query to make a more contextually-informed selection of database constants. |
| Outcome: | The proposed model increases accuracy from 39.4% to 47.4% on a zero-shot semantic parsing dataset with complex databases. |
End-to-End Graph-Based TAG Parsing with Neural Networks (N18-1)
Copied to clipboard
| Challenge: | Using BiLSTMs, highway connections, and character-level CNNs, we propose a graph-based Tree Adjoining Grammar (TAG) parser. |
| Approach: | They propose a graph-based Tree Adjoining Grammar parser that uses BiLSTMs, highway connections, and character-level CNNs. |
| Outcome: | The proposed parser outperforms the previously reported best by more than 2.2 LAS and UAS points. |
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. |
Simple Large-scale Relation Extraction from Unstructured Text (L18-1)
Copied to clipboard
| Challenge: | Knowledge-based question answering relies on the availability of facts, most of which cannot be found in structured sources. |
| Approach: | They propose a method for creating distant (weak) supervision labels for training a large-scale RE system by decoupling the model architecture from the feature design of a state-of-the-art neural network system. |
| Outcome: | The proposed method performs on par with the state-of-the-art model with similar features at 75x reduction in training time. |