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
Book ChapterDOI
01 Jan 2006

18 citations

Book ChapterDOI
28 Jul 2007
TL;DR: A new characterization of the generative capacity of Minimalist Grammar makes it possible to discuss the linguistic relevance of non-projectivity and illnestedness, and provides insight into grammars that derive structures with these properties.
Abstract: This paper provides an interpretation of Minimalist Grammars [16,17] in terms of dependency structures. Under this interpretation, merge operations derive projective dependency structures, and movement operations introduce both non-projectivity and illnestedness. This new characterization of the generative capacity of Minimalist Grammar makes it possible to discuss the linguistic relevance of non-projectivity and illnestedness. This in turn provides insight into grammars that derive structures with these properties.

18 citations

Journal ArticleDOI
TL;DR: This paper deals with the problem of computing relations from their abstract non-algorithmic specifications, and a notion of the relation specified by a two-level grammar is introduced and computability of such relations is discussed.

18 citations

Book ChapterDOI
02 Dec 1986
TL;DR: Non-sequential processes in graph grammars are introduced extending the repertoire of parallelism and concurrency known for graph grammar derivations, and conflict solutions are investigated by applying techniques and results from graph grammar theory.
Abstract: Non-sequential processes in graph grammars are introduced extending the repertoire of parallelism and concurrency known for graph grammar derivations. They are intended to describe the behaviour of systems explicitly where states or data may be distributed and actions may take place concurrently. Our notion of a process is liberal enough to include conflicts among actions so that it reflects potential activities rather than actual running of the system in general. The problem of detecting conflicts in a process is solved by a procedure transforming arbitrary conflicts into local and hence observable ones. For special situations conflict solutions are investigated by applying techniques and results from graph grammar theory.

18 citations

Journal ArticleDOI
01 Jan 1998-Grammars
TL;DR: First, the idea of associating a tree to a derivation in such a grammar is considered, which can be done in a natural way, by associating parentheses to the contexts of the grammar, which obtains a restriction on the derivations in a contextual grammar, as well as a direct manner of defining the ambiguity of contextual grammars.
Abstract: The aim of this paper is to start investigations on the possibilities of introducing a structure in the strings generated by internal contextual grammars. First, we consider the idea of associating a tree to a derivation in such a grammar. This can be done in a natural way, by associating parentheses to the contexts of the grammar. In this way we obtain a restriction on the derivation in a contextual grammar, as well as a direct manner of defining the ambiguity of contextual grammars. Then, we consider a relation on the set of symbols appearing in a string, in the sense already used in descriptive linguistics. By starting from a set of axioms which are structured strings and adjoining to them contexts as usual in contextual grammars, but having prescribed dependences between their symbols, we obtain a set of structured strings. By imposing conditions on the structure of the strings (crossed-noncrossed dependences, a tree structure, a link structure in the sense of link grammars, etc), we obtain a restriction on the derivation in a contextual grammar, as well as a direct manner of defining the structure of languages generated by contextual grammars. The linguistic relevance of these structures associated to strings generated by contextual grammars remains to be further explored.

18 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