The grammar framework presented in this paper combines Lexicalized Tree Adjoining Grammar (LTAG) with a (de)compositional frame semantics. We introduce elementary constructions as pairs of elementary LTAG trees and decompositional frames. The linking between syntax and semantics can largely be captured by such constructions since in LTAG, elementary trees represent full argument projections. Substitution and adjunction in the syntax then trigger the unification of the associated semantic frames, which are formally defined as base-labelled feature structures. Moreover, the system of elementary constructions is specified in a metagrammar by means of tree and frame descriptions. This metagrammatical factorization gives rise to a fine-grained decomposition of the semantic contributions of syntactic building blocks, and it allows us to separate lexical from constructional contributions and to carve out generalizations across constructions. In the second half of the paper, we apply the framework to the analysis of directed motion expressions and of the dative alternation in English, two well known examples of the interaction between lexical and constructional meaning.

The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: KünkelLopka GmbH, HeidelbergPrinted on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Tübingen PrefaceGiven that context-free grammars cannot adequately describe natural languages, grammar formalisms beyond CFG that are still computationally tractable are of central interest for computational linguists. However, despite the considerable interest in such formalisms and in their various parsing algorithms, a coherent textbook that allows access to the large body of knowledge on polynomial-time parsing beyond context-free grammars has not been available so far. Textbooks on parsing covered mainly context-free grammars while mentioning more powerful formalisms only very briefly.This want of a detailed presentation of grammar formalisms and parsing beyond CFG is addressed with this book. The book provides an extensive overview of the formal language landscape between CFG and PTIME. It moves from Tree Adjoining Grammars to Multiple Context-Free Grammars and then to Range Concatenation Grammars while explaining available parsing techniques for these formalisms. The text is enriched with many illustrations and examples coming with the different formalisms and algorithms. This makes the book accessible to anybody familiar with basic notions of CFG parsing. It is useful both for researchers and students in computational linguistics and in formal language theory. Tübingen, Laura Kallmeyer June 2010 AcknowledgmentsFirst of all and most importantly, I want to thank my colleague Wolfgang Maier. We taught two courses at the University of Tübingen and one course at the European Summer School in Logic, Language and Information (ESSLLI) in 2008 in Hamburg, all of them covering the topic of parsing beyond contextfree grammars. The idea to write this textbook arose out of these courses and much material from the course slides was reused when writing the book. The course preparations and the related discussions of the subject were crucial for achieving a good understanding of the topic and being able to cover it in a textbook. Also, when writing the book, I frequently discussed its content and structure with Wolfgang. Therefore one can say that without Wolfgang's help the book would not look as it does and, furthermore, it would very probably not exist at all.The suggestion to write a textbook on parsing beyond context-free grammars came from Carl Vogel who participated in our ESSLLI course on this topic. I am grateful for this suggestion; it made me for the first time seriously consider the idea of covering the course material in a book.

We propose a semantic construction method for Feature-Based Tree Adjoining Grammar which is based on the derived tree, compare it with related proposals and briefly discuss some implementation possibilities.

This paper sets up a framework for Lexicalized Tree Adjoining Grammar (LTAG) semantics that brings together ideas from different recent approaches addressing some shortcomings of LTAG semantics based on the derivation tree. The approach assigns underspecified semantic representations and semantic feature structure descriptions to elementary trees. Semantic computation is guided by the derivation tree and consists of adding feature value equations to the descriptions. A rigorous formal definition of the framework is given. Then, within this framework, an analysis is proposed that accounts for the different scopal properties of quantificational NPs (including nested NPs), adverbs, raising verbs and attitude verbs. Furthermore, by integrating situation variables in the semantics, different situation binding possibilities are derived for different types of quantificational elements.

This paper presents the first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs). LCFRS, an extension of CFG, can describe discontinuities in a straightforward way and is therefore a natural candidate to be used for data-driven parsing. To speed up parsing, we use different context-summary estimates of parse items, some of them allowing for A* parsing. We evaluate our parser with grammars extracted from the German NeGra treebank. Our experiments show that data-driven LCFRS parsing is feasible and yields output of competitive quality.