Automated Graph Generation at Sentence Level for Reading Comprehension Based on Conceptual Graphs (2020.coling-main)
Copied to clipboard
| Challenge: | Using conceptual graphs, we can embed a sentence into a knowledge embedding in a graph to solve slot-filling challenges in question answering and capture neighbouring connections of reference concept nodes. |
| Approach: | They propose a miscellaneous-context-based method to embed a sentence into a directed graph and a task-agnostic semantics module which integrates the syntactic-semantic information. |
| Outcome: | The proposed method can accommodate slot-filling challenges in typical question answering and capture the neighbouring connections of reference concept nodes. |
Similar Papers
Reading Comprehension with Graph-based Temporal-Casual Reasoning (C18-1)
Copied to clipboard
| Challenge: | Existing methods for reading comprehension tasks ignore semantic relations between sentences or use sliding window scanning over the words of the passage without sentence breaks. |
| Approach: | They propose a method to integrate information from multiple sentences to answer complex questions. |
| Outcome: | Experiments on RACE and MCTest show that the proposed approach improves state-of-the-art methods on simple factoid questions. |
Enhancing Knowledge Selection for Grounded Dialogues via Document Semantic Graphs (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing conversation models treat knowledge selection as a sentence ranking problem where each sentence is handled individually, ignoring the internal semantic connection between sentences. |
| Approach: | They propose to automatically convert background knowledge documents into document semantic graphs and perform knowledge selection over such graphs. |
| Outcome: | The proposed model improves on the knowledge selection task and the response generation task on HollE and generalizes on unseen topics in WoW. |
Text Generation from Knowledge Graphs with Graph Transformers (N19-1)
Copied to clipboard
| Challenge: | Existing methods for generating text with structured inputs are expensive and require manual annotation. |
| Approach: | They propose a graph transforming encoder which leverages relational structure of knowledge graphs without imposing linearization or hierarchical constraints. |
| Outcome: | The proposed system produces more informative texts than competing methods. |
Fusing Context Into Knowledge Graph for Commonsense Question Answering (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to combine language modeling and knowledge graphs (KG) lack the context to provide a more precise understanding of the concepts. |
| Approach: | They propose to use external entity descriptions to provide contextual information for commonsense question answering models. |
| Outcome: | The proposed model achieves state-of-the-art among non-generative models in OpenBookQA and is the first of its kind in the field. |
Graph-Based Meaning Representations: Design and Processing (P19-4)
Copied to clipboard
| Challenge: | This tutorial focuses on representing and processing sentence meaning in the form of labeled directed graphs. |
| Approach: | This tutorial will briefly review relevant background in formal and linguistic semantics . it will also briefly define a unified abstract view on different flavors of semantic graphs - and associated terminology . |
| Outcome: | The tutorial will briefly review relevant background in formal and linguistic semantics . |
Knowledge Graph Based Synthetic Corpus Generation for Knowledge-Enhanced Language Model Pre-training (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing work on data-to-text generation focused on domain-specific benchmark datasets. |
| Approach: | They use a KG-Wikipedia text aligned corpus to verbalize the entire English Wikidata KG . they show that this approach can be used to integrate structured KGs and natural language corpora . |
| Outcome: | The proposed method improves on open domain QA and the LAMA knowledge probe. |
Machine Reading Comprehension Using Structural Knowledge Graph-aware Network (D19-1)
Copied to clipboard
| Challenge: | Recent large-scale datasets specify that external knowledge is required to answer questions. |
| Approach: | They propose a model that leverages external knowledge to construct sub-graphs for entities in machine comprehension context. |
| Outcome: | The proposed model achieves state-of-the-art performance on the ReCoRD dataset. |
Building a Knowledge Graph from Natural Language Definitions for Interpretable Text Entailment Recognition (L18-1)
Copied to clipboard
| Challenge: | a conceptual model for dictionary definitions is used to construct a knowledge graph from natural language definitions. |
| Approach: | They propose a method for automatically building a graph world knowledge base from natural language definitions. |
| Outcome: | The proposed method was used in an interpretable text entailment recognition approach. |
Knowledge Graph Compression Enhances Diverse Commonsense Generation (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing models use commonsense knowledge graphs to extract subgraphs of relevant knowledge pertaining to concepts in the input but due to the large coverage and vast scale of ConceptNet, the extracted subgraph may contain loosely related, redundant and irrelevant information. |
| Approach: | They propose to apply a differentiable graph compression algorithm to extract subgraphs of relevant knowledge from input sentences. |
| Outcome: | The proposed algorithm achieves better quality-diversity tradeoff than a large language model with 100 times the number of parameters. |
Automated Knowledge Graph Construction using Large Language Models and Sentence Complexity Modelling (2025.emnlp-main)
Copied to clipboard
Sydney Anuyah, Mehedi Mahmud Kaushik, Sri Rama Krishna Reddy Dwarampudi, Rakesh Shiradkar, Arjan Durresi, Sunandan Chakraborty
| Challenge: | integrating coreference and decomposition increases recall on rare relations by over 20%. |
| Approach: | They propose an open-source pipeline for extracting sentence-level knowledge graphs by combining robust coreference resolution with syntactic sentence decomposition. |
| Outcome: | The proposed pipeline achieves a 99.8% exact-match accuracy on sentence simplification. |