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 published on a yearly basis
Papers
More filters
••
TL;DR: It is shown that by utilizing the so-called filter function of transformations the descriptive power of transformational grammars can be preserved unreduced even when their base components are subjected to drastic restrictions.
Abstract: We investigate the effects of placing various restrictions on the base component of a transformational grammar as defined by Chomsky (1965) . It is shown that by utilizing the so-called filter function of transformations the descriptive power of transformational grammars can be preserved unreduced even when their base components are subjected to drastic restrictions.
50 citations
•
01 Jan 1994
TL;DR: This chapter discusses the basic theory of rigid grammars, a theorem of finite elasticity, and the learnability theorem, which describes the structure of grammar according to k-valued and least-valued values.
Abstract: 1. Introduction 2. Learnability theorem 3. A theorem of finite elasticity 4. Classical categorial grammar 5. Basic theory of rigid grammars 6. Learning from structures I: rigid, k-valued, and least-valued grammar 7. Learning from structures II: Subclasses of the optimal grammars 8. Learning from strings 9. Variations 10. Conclusions Appendix.
50 citations
••
23 Apr 1997TL;DR: A context sensitive graph grammar called reserved graph grammar is presented which can explicitly, efficiently and completely describe the syntax of a wide range of diagrams using labeled graphs and its parsing algorithm is of polynomial time complexity in most cases.
Abstract: When implementing textual languages, formal grammars are commonly used to facilitate understanding languages and creating parsers. In the implementation of a diagrammatic visual programming language (VPL), this rarely happens, though graph grammars with their well established theoretical background may be used as a natural and powerful syntax definition formalism. Yet all graph grammar parsing algorithms presented up to now are either unable to recognize interesting visual languages or tend to be hopelessly inefficient (with exponential time complexity) when applied to graphs with a large number of nodes and edges. The paper presents a context sensitive graph grammar called reserved graph grammar which can explicitly, efficiently and completely describe the syntax of a wide range of diagrams using labeled graphs. Moreover its parsing algorithm is of polynomial time complexity in most cases.
50 citations
••
TL;DR: This work investigates this type of graph grammar and shows that the use of edge labels (together with the NCE feature) is responsible for some new properties, and proves that the class of (boundary) eNCE languages properly contains the closure of theclass of ( boundary) NLC languages under node relabelings.
49 citations
••
TL;DR: Four different kinds of grammars that can define crossing dependencies in human language are compared here and some results relevant to the viability of mildly context sensitive analyses and some open questions are reviewed.
49 citations