Generalizing Discontinuities Categorially

This paper reports on the way in which emanations of (typical Dutch) verb clusterings and (more general) long distance dependencies are captured in similar fashions by Delilah's mode of generalized composition. 1 Categorial Grammar made context-sensitiv

Exploiting logical forms

This paper presents a semantic setup for Dutch on the basis of deep processing. The parser and generator Delilah computes a system of logical forms that is both semantically adequate, and instrumental in processing tasks like disambiguation and inference. The logical forms are derivationally related but differ as to the level of specification and exploitability. The semantic setup is new, and is likely to be the first computed, fully specified semantics for Dutch. One of the logical forms introduces a new way of compiling out semantic dependencies. The resulting system is discussed at the crossroad of logical semantics and computational linguistics

Filtering Left Dislocation Chains in Parsing Categorial Grammar

This paper reports on a way to reduce the complexity of the process of left dislocation (re)construction for categorial grammar in the case of lexically assigned gaps, as an additional restriction on the complexity arising from lexical polymorphism in general. Specifying extraction sites lexically has the advantage that the combinatory explosion can be contained in the preparsing track by a specialized constraint on the expansion of sequences of categories. This constraint is called the Left Dislocation Chain Filter and is implemented by a Finite State Transducer. It is shown that the Filter can reduce the number of full string assignments under consideration prior to parsing with an average of one half to one order of magnitude, depending on the nature of the sentence. 1 Parsing Left Dislocation Left dislocation is a very common, almost universal phenomenon in natural languages. It establishes the relation between an element at the left periphery of a clause and a particular, lexical..

Pruning Search Space For Parsing Free Coordination In Categorial Grammar

The standard resource sensitive invariants of categorial grammar are not suited to prune search space in the presence of coordination. We propose a weaker variant of count invariancy in order to prune the search space for parsing coordinated sentences at a stage prior to proper parsing. This Coordinative Count Invariant is argued to be the strongest possible instrument to prune search space for parsing coordination in categorial grammar. Its mode of operation is explained, and its effect at pruning search space is exemplified. 1 1 Lexical Ambiguity and Natural Language Parsing Lexical ambiguity is known to be a major threat to efficient parsing of natural language. It is easy to see why. Let G NL be a grammar for a language NL, and L a lexicon with initial assignment A of nonterminals to the words of NL. Let S = w 1 ... w n be a sentence over L. Under a parsing-as-deductionapproach, then, the parsing problem for S is whether for some sequence C = c 1 ... c n , with c Î A(w ), C is der..