Uniform Parsing for Hyperedge Replacement Grammars
Reads0
Chats0
TLDR
It is shown that hyperedge-replacement grammars can generate NP-complete graph languages even under seemingly harsh restrictions and the parsing problem is difficult even in the n graph languages.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2021-06-01 and is currently open access. It has received 8 citations till now. The article focuses on the topics: Parsing & Graph (abstract data type).read more
Citations
More filters
Book ChapterDOI
Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars
TL;DR: Parsing with respect to grammars based on hyperedge replacement (HR) is NP-hard in general, even for some fixed Grammars, but in recent work predictive shift-reduce parsing (PSR) is devised, a version of which has never been seen before.
Proceedings ArticleDOI
Parsing Weighted Order-Preserving Hyperedge Replacement Grammars
TL;DR: A weighted extension of the recently proposed notion of order-preserving hyperedge-replacement grammars is introduced and it is proved that the weight of a graph according to such a weighted graph grammar is determined.
Order-preserving graph grammars
TL;DR: The field of semantic modelling concerns formal models for semantics, that is, formal structures for the computational and algorithmic processing of meaning.
Journal ArticleDOI
Engineering Grammar-Based Type Checking for Graph Rewriting Languages
TL;DR: In this paper , a type checking framework that applies the basic idea of Structured Gamma to a concrete graph rewriting language, LMNtal ShapeType, is presented, which allows to manipulate graph structures in such a way that the well-formedness of graphs is guaranteed by the language itself.
Journal ArticleDOI
Engineering Grammar-Based Type Checking for Graph Rewriting Languages
TL;DR: In this paper , a type checking framework for graph rewriting language LMNtal ShapeType is presented. But since the shapes of graphs can be complex and diverse compared to algebraic data structures such as lists and trees, it is a non-obvious important task to formulate types of graphs to verify individual programs.
References
More filters
Proceedings Article
Abstract Meaning Representation for Sembanking
Laura Banarescu,Claire Bonial,Shu Cai,Madalina Georgescu,Kira Griffitt,Ulf Hermjakob,Kevin Knight,Philipp Koehn,Martha Palmer,Nathan Schneider +9 more
TL;DR: A sembank of simple, whole-sentence semantic structures will spur new work in statistical natural language understanding and generation, like the Penn Treebank encouraged work on statistical parsing.
Book
Hyperedge Replacement: Grammars and Languages
TL;DR: General Introduction to hyperedge-replacement grammars and basic properties of HRG's and characterizations of HRL's.
Book
Hyperedge replacement graph grammars
TL;DR: To cover a large part of the theory of hyperedge replacement, structural properties and decision problems, including the membership problem, are addressed.
Journal ArticleDOI
Graph expressions and graph rewritings
Michel Bauderon,Bruno Courcelle +1 more
TL;DR: By working at the level of expressions, a notion of graph rewriting is derived which is as powerful as the usual one (based on a categorical approach) introduced by Ehrig, Pfender, and Schneider.
Book ChapterDOI
May we introduce to you: hyperedge replacement
TL;DR: This kind of tutorial note explains how graphs can be rewritten by edge replacement with formal definitions accompanied by intuitive descriptions and a series of examples.