scispace - formally typeset
Search or ask a question
Topic

Context-sensitive grammar

About: Context-sensitive grammar is a research topic. Over the lifetime, 1938 publications have been published within this topic receiving 45911 citations. The topic is also known as: CSG.


Papers
More filters
01 Apr 2015
TL;DR: S-graph grammars are introduced, a new grammar formalism for computing graph-based semantic representations that uses graphs as semantic representations in a way that is consistent with more classical views on semantic construction.
Abstract: We introduce s-graph grammars, a new grammar formalism for computing graph-based semantic representations. Semantically annotated corpora which use graphs as semantic representations have recently become available, and there have been a number of data-driven systems for semantic parsing that can be trained on these corpora. However, it is hard to map the linguistic assumptions of these systems onto more classical insights on semantic construction. S-graph grammars use graphs as semantic representations, in a way that is consistent with more classical views on semantic construction. We illustrate this with a number of hand-written toy grammars, sketch the use of s-graph grammars for data-driven semantic parsing, and discuss formal aspects.

25 citations

Book
01 Dec 1991
TL;DR: GraphEd as discussed by the authors is an interactive tool for developing graph grammars based on node rewriting and is a hybrid editor for PROgrammed Graph REwriting SyStems, a graph rewriting language.
Abstract: A note on hyperedge replacement.- Graph grammars based on node rewriting: an introduction to NLC graph grammars.- Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts.- The logical expression of graph properties.- Panel discussion: The use of graph grammars in applications.- GraphEd: An interactive tool for developing graph grammars.- Presentation of the IPSEN-Environment: An Integrated and Incremental Project Support ENviroment.- Presentation of the PROGRESS-Editor: A text-oriented hybrid editor for PROgrammed Graph REwriting SyStems.- PLEXUS: Tools for analyzing graph grammars.- An algebraic theory of graph reduction.- Programming with very large graphs.- Describing Gottler's operational graph grammars with pushouts.- General solution to a system of recursive equations on hypergraphs.- Construction of map OL-systems for developmental sequences of plant cell layers.- Layout graph grammars: The placement approach.- Cycle chain code picture languages.- An efficient implementation of graph grammars based on the RETE matching algorithm.- An application of graph grammars to the elimination of redundancy from functions defined by schemes.- Graphic equivalence and computer optimization.- Graph grammars and logic programming.- Graphs as relational structures : An algebraic and logical approach.- Context-free handle-rewriting hypergraph grammars.- From graph grammars to high level replacement systems.- Algebraic specification grammars: A junction between module specifications and graph grammars.- A characterization of context-free NCE graph languages by monadic second-order logic on trees.- The term generating power of context-free hypergraph grammars.- Elementary actions on an extended entity-relationship database.- Physically-based graphical interpretation of marker cellwork L-systems.- Dactl: An experimental graph rewriting language.- Use graph grammars to design CAD-systems !.- Collage grammars.- The four musicians: analogies and expert systems - a graphic approach.- Structured transformations and computation graphs for actor grammars.- Grammatical inference based on hyperedge replacement.- Specifying concurrent languages and systems with ?-grammars.- Graph rewriting in some categories of partial morphisms.- Application of graph grammars to rule-based systems.- Tree automata, tree decomposition and hyperedge replacement.- Recognizing rooted context-free flowgraph languages in polynomial time.- Computing with graph relabelling systems with priorities.- Double-wall cellwork systems for plant meristems.- Programmed derivations of relational structures.- A specification environment for graph grammars.- The theory of graphoids: A survey.- Graph-reducible term rewriting systems.- A note on graph decimation.- Progress: A VHL-language based on graph grammars.- Movement of objects in configuration spaces modelled by graph grammars.- Recognizing edge replacement graph languages in cubic time.- Computing by graph transformation: Overall aims and new results.

25 citations

Proceedings Article
01 May 2008
TL;DR: A framework allowing to describe tree-based grammars, and an actual fragment of a core multicomponent tree-adjoining grammar with tree tuples (TT-MCTAG) for German developed using this framework.
Abstract: Developing linguistic resources, in particular grammars, is known to be a complex task in itself, because of (amongst others) redundancy and consistency issues. Furthermore some languages can reveal themselves hard to describe because of specific characteristics, e.g. the free word order in German. In this context, we present (i) a framework allowing to describe tree-based grammars, and (ii) an actual fragment of a core multicomponent tree-adjoining grammar with tree tuples (TT-MCTAG) for German developed using this framework. This framework combines a metagrammar compiler and a parser based on range concatenation grammar (RCG) to respectively check the consistency and the correction of the grammar. The German grammar being developed within this framework already deals with a wide range of scrambling and extraction phenomena.

25 citations

Proceedings Article
01 Jan 1999
TL;DR: This work presents a necessary and sufficient, but in general undecidable, criterion for exponential ambiguity, and provides the possibility to distinguish infinitely ambiguous context-free grammars by the growth-rate of their ambiguity functions.

25 citations

Book ChapterDOI
Henk Alblas1
04 Jun 1991
TL;DR: In this paper, the authors recall the definition of attribute grammars and give a first impression of the applicability and the power of the attribute grammar for type-determination problems.
Abstract: This paper recalls the definition of attribute grammars. To give a first impression of the applicability and the power of attribute grammars two examples are given which describe the type-determination problem for simple arithmetic expressions. Also, Knuth's circularity test for attribute grammars is described.

24 citations


Network Information
Related Topics (5)
Graph (abstract data type)
69.9K papers, 1.2M citations
80% related
Time complexity
36K papers, 879.5K citations
79% related
Concurrency
13K papers, 347.1K citations
78% related
Model checking
16.9K papers, 451.6K citations
77% related
Directed graph
12.2K papers, 302.4K citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202311
202212
20211
20204
20191
20181