We consider internal contextual grammars (with finite and with regular selection sets) with the derivation restricted in the following way: when a word is used as a selector, then no subword/superword of it can be used as a selector. This can be considered both locally (with respect to the chosen selection set) or globally (with respect to all selection sets). The generative capacity of such grammars is investigated (comparing each other the above mentioned variants and with the class of unrestricted internal contextual grammars). Finally, grammars with selectors checked as scattered subwords of the derived words are considered.

ABSTRACT. The paper presents Colored Multiplanar Link Grammars (CMLG). These grammars are reducible to extended right-linear S-grammars (Wartena 2001) where the storage type S is a concatenation of c pushdowns. The number of colors available in these grammars induces a hierarchy of Classes of CMLGs. By fixing also another parameter in CMLGs, namely the bound t for non-projectivity depth, we get c-Colored t-Non-projective Dependency Grammars (CNDG) that generate acyclic dependency graphs. Thus, CNDGs form a two-dimensional hierarchy of dependency grammars. A part of this hierarchy is mildly context-sensitive and non-projective. This paper proposes non-projective, polynomially parseable lexicalized grammars capable of describing scrambling and long-distance dependencies up to a bounded nested crossing depth and a bounded nonprojectivity depth.

The paper presents Colored Multiplanar Link Grammars (CMLG). These grammars are reducible to extended right-linear S-grammars (Wartena 2001) where the storage type S is a concatenation of c pushdowns. The number of colors available in these grammars induces a hierarchy of Classes of CMLGs. By fixing also another parameter in CMLGs, namely the bound t for non-projectivity depth, we get c-Colored t-Non-projective Dependency Grammars (CNDG) that generate acyclic dependency graphs.

The possibility of formulating conditions that made reference to multiple derivations was a staple of early work in Generative Semantics. In this paper we explore the possibility of having constraints arise from the interaction between derivations in an extended Generative Semantics-type (GS) grammar. In GS syntactic operations apply to semantic material in phrase structure trees; in our extension, these operations can apply within and across derivations. To this end, we will appeal to Tree Adjoining Grammars (TAG; Joshi, 1985 and much subsequent work). The model we propose thus assumes two basic operations, which are the singulary and the generalized versions of a single compositional generative operation. The singulary, tree-internal version is Predicate Raising, which ‘adjoins a predicate to the next higher predicate’ (McCawley, 1973a [1968]: 157); the generalized version is Adjoin, which ‘composes an auxiliary tree b with a tree g’ (Joshi, 1985: 209), thus applying transderivationally. The empirical motivation for this expansion of generative semantics comes from the analysis of an apparently anomalous case of secondary predication in Spanish and English, which –we argue- shares properties with depictive and resultative constructions but in fact is neither.

Contextual Grammars (CGs) provide an appropriate description of natural languages. Unfortunately, no parser which runs in polynomial time was known for some linguistically relevant classes. In this paper, an intertwined two--level Earley--based parser for CGs with finite, regular and context--free selectors is presented. In both phases context--free grammars are defined which identify individual selectors and contexts in the input string and which find context--selector pairs. The Earley algorithms provides an e#cient data structure to exchange the results between the two phases (i.e. phase one -# phase two: contexts and selectors, phase two -# phase one: erased contexts according to a production) and to reuse intermedidate results e#ectively when repeatingly new contexts and selectors are predicted for each removed context in the input string and consequently new productions are identified. As we deploy a polynomial parser for CGs with context--free selectors, the li...