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 has been claimed in the literature that for every tree-adjoining grammar, one can construct a strongly equivalent lexicalized version, but it is shown that such a procedure does not exist: Tree-ad joining grammars are not closed under strong lexicalization.
Abstract: A lexicalized tree-adjoining grammar is a tree-adjoining grammar where each elementary tree contains some overt lexical item. Such grammars are being used to give lexical accounts of syntactic phenomena, where an elementary tree defines the domain of locality of the syntactic and semantic dependencies of its lexical items. It has been claimed in the literature that for every tree-adjoining grammar, one can construct a strongly equivalent lexicalized version. We show that such a procedure does not exist: Tree-adjoining grammars are not closed under strong lexicalization.
10 citations
TL;DR: A technique for forming a context free grammar for a document that has some kind of tagging-structural or typographical-but no concise description of the structure is available, based on ideas from machine learning.
10 citations
Journal Article•
TL;DR: It is argued that even those newer AnBn grammars cannot test the learning of syntactic hierarchy, and serves to interpret recent animal studies, which make surprising claims about animals’ ability to handle center embedding.
Abstract: Recent artificial-grammar learning (AGL) paradigms driven by the Chomsky hierarchy paved the way for direct comparisons between humans and animals in the learning of center embedding ([A[AB]B]). The AnBn grammars used by the first generation of such research lacked a crucial property of center embedding, where the pairs of elements are explicitly matched ([A1 [A2 B2] B1]). This type of indexing is implemented in the second-generation AnBn grammars. This paper reviews recent studies using such grammars. Against the premises of these studies, we argue that even those newer AnBn grammars cannot test the learning of syntactic hierarchy. These studies nonetheless provide detailed information about the conditions under which human adults can learn an AnBn grammar with indexing. This knowledge serves to interpret recent animal studies, which make surprising claims about animals’ ability to handle center embedding.
10 citations
TL;DR: A generalization of the finite state acceptors for derivation structures and for phrase structures is defined and it is proved that the set of syntactic structures of a recursively enumerable language is recursive.
Abstract: We define a generalization of the finite state acceptors for derivation structures and for phrase structures. Corresponding to the Chomsky hierarchy of grammars, there is a hierarchy of acceptors, and for both kinds of structures, the type 2 acceptors are tree automata. For i = 0, 1, 2, 3, the sets of structures recognized by the type i acceptors are just the sets of projections of the structures of the type i grammars, and the languages of the type i acceptors are just the type i languages. Finally, we prove that the set of syntactic structures of a recursively enumerable language is recursive.
10 citations
23 May 2011
TL;DR: This work refines the relationship among the classes of languages generated by the above grammars and Local languages and states some considerations about closure properties of (regular) pure 2D context-free languages.
Abstract: Many formal models have been proposed to recognize or to generate two-dimensional words. In this paper, we focus our analysis on (regular) pure 2D context-free grammars, regional tile grammars and Průsa grammars, showing that nevertheless they have been proposed as a generalization of string context free grammars their expressiveness is different. This work refines the relationship among the classes of languages generated by the above grammars and Local languages and states some considerations about closure properties of (regular) pure 2D context-free languages.
10 citations