Graph-based semantic representations are popular in natural language processing, where it
is often convenient to model linguistic concepts as nodes and relations as edges between …

Parsing with respect to grammars based on hyperedge replacement (HR) is NP-hard in
general, even for some fixed grammars. In recent work, we have devised predictive shift …

The ability to handle evolving graph structures is important both for programming languages
and modeling languages. Of various languages that adopt graphs as primary data …

We introduce a fold operation that realises a tree-to-graph transduction by merging selected
nodes in the input tree to form a possibly cyclic output graph. The work is motivated by the …

We introduce a weighted extension of the recently proposed notion of order-preserving
hyperedge-replacement grammars and prove that the weight of a graph according to such a …

In natural language processing, the syntax of a sentence refers to the words used in the
sentence, their grammatical role, and their order. Semantics concerns the concepts …

We investigate complexity of the uniform membership problem for hyperedge replacement
grammars in comparison with other mildly context-sensitive grammar formalisms. It turns out …

Order-preserving DAG grammars (OPDGs) is a formalism for representing languages of
structurally restricted graphs. As demonstrated in [17], they are sufficiently expressive to …

Graph-based semantic representations are valuable in natural language processing, where
it is often simple and effective to represent linguistic concepts as nodes, and relations as …

We present a novel approach for the random generation of graphs in context-free
hypergraph languages. It is obtained by adapting both of Mairson's generation algorithms for …