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 the set of all interpretations of one (or of all) context-free grammar forms modulo strong equivalence is a distributive lattice with respect to the ordering relation “is an interpretation of”.
Abstract: It is shown that the set of all interpretations of one (or of all) context-free grammar forms modulo strong equivalence is a distributive lattice with respect to the ordering relation “is an interpretation of”. It is also established that for each context-free grammar form there exists a unique (up to “pseudo-isomorphism”) symbol-tight, strongly equivalent context-free grammar form which is minimal with respect to the number of productions.
8 citations
TL;DR: In this article, a direct proof of the equivalence of FCGs and simple phrase structure grammars (SPGs) is given, which is based on the idea due to Ajdukiewicz.
Abstract: In [2], Bar-Hillel, Gaifman, and Shamir prove that the simple phrase structure grammars (SPGs) defined by Chomsky are equivalent in a certain sense to Bar-Hillel's bidirectional categorial grammars (BCGs). On the other hand, Cohen [3] proves the equivalence of the latter ones to what the calls free categorial grammars (FCGs). They are closely related to Lambek's syntactic calculus which, in turn, is based on the idea due to Ajdukiewicz [1]. For the reasons which will be discussed in the last section, Cohen's proof seems to be at least incomplete. This paper yields a direct proof of the equivalence ofFCGs andSPGs.
8 citations
TL;DR: It is shown that the direction-independent restriction does not affect the generative powers of MAG, but it does, however, affect theGenerative power of a restricted version of ∗AG, i.e., connected ∗-array grammars.
8 citations
TL;DR: This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars and proposes a learning algorithm based on the parsing strategy presented and its validity is proved and its properties are examplified.
Abstract: This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved In the last two parts, we focus on learning Pregroup Grammars from a special kind of input called feature-tagged examples A learning algorithm based on the parsing strategy presented in the first part is given Its validity is proved and its properties are examplified
8 citations