Generating Semantic Graph Corpora with Graph Expansion Grammar

• URL: http://arxiv.org/abs/2309.08714v1
• Date: Fri, 15 Sep 2023 19:10:19 GMT
• Title: Generating Semantic Graph Corpora with Graph Expansion Grammar
• Authors: Eric Andersson (Ume{\aa} University), Johanna Bj\"orklund (Ume{\aa} University), Frank Drewes (Ume{\aa} University), Anna Jonsson (Ume{\aa} University)
• Abstract summary: Lovelace is a tool for creating corpora of semantic graphs. The system uses graph expansion grammar as a representational language. Central use cases are the creation of synthetic data to augment existing corpora, and as a pedagogical tool for teaching formal language theory.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce Lovelace, a tool for creating corpora of semantic graphs. The system uses graph expansion grammar as a representational language, thus allowing users to craft a grammar that describes a corpus with desired properties. When given such grammar as input, the system generates a set of output graphs that are well-formed according to the grammar, i.e., a graph bank. The generation process can be controlled via a number of configurable parameters that allow the user to, for example, specify a range of desired output graph sizes. Central use cases are the creation of synthetic data to augment existing corpora, and as a pedagogical tool for teaching formal language theory.

Related papers

• When Graph Data Meets Multimodal: A New Paradigm for Graph Understanding and Reasoning [54.84870836443311]
  The paper presents a new paradigm for understanding and reasoning about graph data by integrating image encoding and multimodal technologies. This approach enables the comprehension of graph data through an instruction-response format, utilizing GPT-4V's advanced capabilities. The study evaluates this paradigm on various graph types, highlighting the model's strengths and weaknesses, particularly in Chinese OCR performance and complex reasoning tasks.
  arXiv  Detail & Related papers  (2023-12-16T08:14:11Z)
• Hi-ArG: Exploring the Integration of Hierarchical Argumentation Graphs in Language Pretraining [62.069374456021016]
  We propose the Hierarchical Argumentation Graph (Hi-ArG), a new structure to organize arguments. We also introduce two approaches to exploit Hi-ArG, including a text-graph multi-modal model GreaseArG and a new pre-training framework augmented with graph information.
  arXiv  Detail & Related papers  (2023-12-01T19:03:38Z)
• Dynamic Vertex Replacement Grammars [6.3872634680339635]
  We show that DyVeRG grammars can be learned from, and used to generate, real-world dynamic graphs faithfully. We also demonstrate their ability to forecast by computing dyvergence scores, a novel graph similarity measurement.
  arXiv  Detail & Related papers  (2023-03-21T02:44:15Z)
• Explanation Graph Generation via Pre-trained Language Models: An Empirical Study with Contrastive Learning [84.35102534158621]
  We study pre-trained language models that generate explanation graphs in an end-to-end manner. We propose simple yet effective ways of graph perturbations via node and edge edit operations. Our methods lead to significant improvements in both structural and semantic accuracy of explanation graphs.
  arXiv  Detail & Related papers  (2022-04-11T00:58:27Z)
• On Bi-gram Graph Attributes [0.0]
  We propose a new approach to text semantic analysis using a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as unique insights or against other corpus graphs.
  arXiv  Detail & Related papers  (2021-07-05T16:36:19Z)
• Do Transformers Really Perform Bad for Graph Representation? [62.68420868623308]
  We present Graphormer, which is built upon the standard Transformer architecture. Our key insight to utilizing Transformer in the graph is the necessity of effectively encoding the structural information of a graph into the model.
  arXiv  Detail & Related papers  (2021-06-09T17:18:52Z)
• Stage-wise Fine-tuning for Graph-to-Text Generation [25.379346921398326]
  Graph-to-text generation has benefited from pre-trained language models (PLMs) in achieving better performance than structured graph encoders. We propose a structured graph-to-text model with a two-step fine-tuning mechanism which first fine-tunes model on Wikipedia before adapting to the graph-to-text generation.
  arXiv  Detail & Related papers  (2021-05-17T17:15:29Z)
• Polynomial Graph Parsing with Non-Structural Reentrancies [0.2867517731896504]
  Graph-based semantic representations are valuable in natural language processing. We introduce graph extension grammar, which generates graphs with non-structural reentrancies. We provide a parsing algorithm for graph extension grammars, which is proved to be correct and run in time.
  arXiv  Detail & Related papers  (2021-05-05T13:05:01Z)
• Promoting Graph Awareness in Linearized Graph-to-Text Generation [72.83863719868364]
  We study the ability of linearized models to encode local graph structures. Our findings motivate solutions to enrich the quality of models' implicit graph encodings. We find that these denoising scaffolds lead to substantial improvements in downstream generation in low-resource settings.
  arXiv  Detail & Related papers  (2020-12-31T18:17:57Z)
• Relation Extraction with Self-determined Graph Convolutional Network [9.752388851329664]
  Relation Extraction is a way of obtaining the semantic relationship between entities in text. The state-of-the-art methods use linguistic tools to build a graph for the text in which the entities appear. We propose a novel model, the Self-determined Graph Convolutional Network (SGCN), which determines a weighted graph using a self-attention mechanism.
  arXiv  Detail & Related papers  (2020-08-02T09:52:58Z)
• Graph-Structured Referring Expression Reasoning in The Wild [105.95488002374158]
  Grounding referring expressions aims to locate in an image an object referred to by a natural language expression. We propose a scene graph guided modular network (SGMN) to perform reasoning over a semantic graph and a scene graph. We also propose Ref-Reasoning, a large-scale real-world dataset for structured referring expression reasoning.
  arXiv  Detail & Related papers  (2020-04-19T11:00:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.