Generating Knowledge Graph Paths from Textual Definitions using Sequence-to-Sequence Models (N19-1)
Copied to clipboard
| Challenge: | a novel method for mapping unrestricted text to knowledge graph entities is proposed . a proof-of-concept experiment has encouraging results comparable to those of state-of the-art systems. |
| Approach: | They propose a method for mapping unrestricted text to knowledge graph entities by framing the task as a sequence-to-sequence problem. |
| Outcome: | The proposed method produces highly interpretable predictions comparable to state-of-the-art systems. |
Similar Papers
ENT-DESC: Entity Description Generation by Exploring Knowledge Graph (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for knowledge-to-text generation use RDF triples or key-value pairs to generate a natural language description. |
| Approach: | They propose a large-scale dataset to facilitate the study of KG-to-text . they propose MGCN model architecture that incorporates aggregation methods to extract the rich graph information. |
| Outcome: | The proposed model can represent the original graph information more comprehensively and integrates multiple aggregation methods to extract the rich graph information. |
A Graph-to-Sequence Model for AMR-to-Text Generation (P18-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) is a semantic formalism that encodes the meaning of a sentence as a rooted, directed graph. |
| Approach: | They propose a neural graph-to-sequence model that leverages LSTM to encode a linearized AMR structure. |
| Outcome: | The proposed model outperforms existing methods on a benchmark. |
Syntax Controlled Knowledge Graph-to-Text Generation with Order and Semantic Consistency (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing knowledge graph-to-text generation methods focus on sequence-to sequence generation, but the linearized order of KG is obtained through a heuristic search without data-driven optimization. |
| Approach: | They propose to generate easy-to-understand sentences from the knowledge graph . they incorporate part-of-speech syntactic tags to constrain the positions to copy words from the KG and employ a semantic context scoring function to evaluate the semantic fitness for each word in its local context. |
| Outcome: | The proposed method achieves state-of-the-art on two datasets, WebNLG and DART, and achieves high consistency. |
SQL-to-Text Generation with Graph-to-Sequence Model (D18-1)
Copied to clipboard
| Challenge: | Existing approaches to generate SQL-to-text using seq2seq models do not capture graph-structured information in SQL query. |
| Approach: | They propose a graph-to-sequence model to encode global structure information into node embeddings. |
| Outcome: | The proposed model outperforms the Seq2Seq and Tree2Sq baselines on the WikiSQL and Stackoverflow datasets. |
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. |
Mapping Text to Knowledge Graph Entities using Multi-Sense LSTMs (D18-1)
Copied to clipboard
| Challenge: | a paper addresses the problem of mapping natural language text to knowledge base entities. |
| Approach: | They propose a model for mapping natural language text to knowledge base entities using a multi-dimensional entity space obtained from a knowledge graph. |
| Outcome: | The proposed model is applied to large-scale text-to-entity mapping and entity classification tasks with state-of-the-art results. |
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 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. |
Structured Self-Supervised Pretraining for Commonsense Knowledge Graph Completion (2021.tacl-1)
Copied to clipboard
| Challenge: | Existing approaches focus on generating concepts that have direct and obvious relationships with existing concepts and lack an ability to generate unobvious concepts. |
| Approach: | They propose a general graph-to-paths pretraining framework that leverages high-order structures in CKGs to capture high-level relationships between concepts. |
| Outcome: | The proposed framework can capture high-order relationships between concepts in four special cases: long path, path-to-path, router, and graph-node-path. |
Sequence-to-sequence Models for Cache Transition Systems (P18-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) is a semantic formalism where the meaning of a sentence is encoded as a rooted, directed graph. |
| Approach: | They propose a sequence-to-sequence based approach for mapping natural language sentences to AMR semantic graphs using a special transition system called a cache transition system. |
| Outcome: | The proposed model outperforms other sequence-to-sequence approaches and achieves competitive results in comparison with the best-performing models. |