Add to ORKGAbstract: This paper proposes an edge-based context-sensitive graph grammar formalism with a concentration on solving the main graph grammar problem⎯embedding problem, and discusses the features of the proposed graph grammar and its parsing algorithm. Some comparisons of the proposed graph grammars with other existing grammars are given. Further researches on graph grammars are also reviewed. Key words: visual language; formalism; graph grammar; embedding problem; production 摘 要: 围绕解决图文法中的主要问题——嵌入问题,提出了一种基于边的上下文相关图文法形式化框架,并
Graph grammar has been widely applied in many scientific areas. However, designing graph grammar is ...
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. c...
Formal methods are scarcely used in industrial applications. Industrial strength tools and education...
Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programmi...
Graph grammars are graph replacement systems and can be therefore regarded as a generalization of we...
An edge grammar is a formal mechanism for representing families of related graphs (binary trees, hyp...
The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses...
AbstractIn this paper we define graph grammars, called the node-replacement graph grammars with path...
In this paper, we suggest a class of (attributed) expansive graph grammars which generate languages ...
<div><p>The parsing problem is one of the key problems of graph grammars. The typical parsing algori...
The field of semantic modelling concerns formal models for semantics, that is, formal structures for...
AbstractWe introduce a graph-grammar model based on edge-replacement, where both the rewriting and t...
Computer programs that can be expressed in two or more dimensions are typically called visual progra...
Graph grammars and graph grammar parsers are to visual languages what string grammars and parsers ar...
Directed graphs are an intuitive and versatile representation of natural language meaning because th...
Graph grammar has been widely applied in many scientific areas. However, designing graph grammar is ...
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. c...
Formal methods are scarcely used in industrial applications. Industrial strength tools and education...
Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programmi...
Graph grammars are graph replacement systems and can be therefore regarded as a generalization of we...
An edge grammar is a formal mechanism for representing families of related graphs (binary trees, hyp...
The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses...
AbstractIn this paper we define graph grammars, called the node-replacement graph grammars with path...
In this paper, we suggest a class of (attributed) expansive graph grammars which generate languages ...
<div><p>The parsing problem is one of the key problems of graph grammars. The typical parsing algori...
The field of semantic modelling concerns formal models for semantics, that is, formal structures for...
AbstractWe introduce a graph-grammar model based on edge-replacement, where both the rewriting and t...
Computer programs that can be expressed in two or more dimensions are typically called visual progra...
Graph grammars and graph grammar parsers are to visual languages what string grammars and parsers ar...
Directed graphs are an intuitive and versatile representation of natural language meaning because th...
Graph grammar has been widely applied in many scientific areas. However, designing graph grammar is ...
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. c...
Formal methods are scarcely used in industrial applications. Industrial strength tools and education...