Refine
Year of publication
- 2004 (508) (remove)
Document Type
- Article (163)
- Working Paper (71)
- Part of a Book (68)
- Conference Proceeding (53)
- Preprint (48)
- Doctoral Thesis (43)
- Part of Periodical (34)
- Report (13)
- Book (10)
- diplomthesis (2)
Language
- English (508) (remove)
Keywords
- Syntax (26)
- Generative Transformationsgrammatik (23)
- Wortstellung (21)
- Deutsch (16)
- Optimalitätstheorie (12)
- Phonologie (11)
- Deutschland (9)
- Relativsatz (9)
- Englisch (8)
- Formale Semantik (8)
Institute
- Physik (75)
- Wirtschaftswissenschaften (38)
- Center for Financial Studies (CFS) (28)
- Medizin (27)
- Extern (24)
- Biochemie und Chemie (23)
- Frankfurt Institute for Advanced Studies (FIAS) (20)
- Biowissenschaften (12)
- Informatik (12)
- Mathematik (9)
During the past fifty years sign languages have been recognised as genuine languages with their own syntax and distinctive phonology. In the case of sign languages, phonetic description characterises the manual and non-manual aspects of signing. The latter relate to facial expression and upper torso position. In the case of manual components these characterise hand shape, orientation and position, and hand/arm movement in three dimensional space around the signer's body. These phonetic charcaterisations can be notated as HamNoSys descriptions of signs which has an executable interpretation to drive an avatar.
The HPSG sign language generation component of a text to sign language system prototype is described. The assimilation of SL morphological features to generate signs which respect positional agreement in signing space are emphasised.
In this study we show that constituency is of limited importance for a proper treatment of the interaction between the linear position of a wa-marked nominal in a Japanese sentence and possible domains of contrastive focus, and that constraints concerning contrastive focus should be represented in terms of linear order and not constituency. Linearisation HPSG, where linear order is independent from constituency, provides a good basis for an analysis. Some constraints are provided in terms of order domains, and it is shown that these constraints can deal with the phenomena in question, and that the cases problematic for the constituency-based analyses can also be accounted for by our analysis.
In this paper I present two classes of double object constructions in Modern Greek, i.e., the genitive, as well as the double accusative, ditransitive constructions. I show that these two classes differ from one another in that not both of them permit derivational processes such as the formation of adjectival passives. I also look at the case properties associated with the verbs which head Modern Greek genitive and double accusative ditransitive constructions. Finally, the analysis I propose for these constructions in Modern Greek are formalized using the Minimal Recursion Semantics (MRS) framework of Copestake et al. (2001) and Copestake et al. (2003).
The Russian data presented in Perlmutter and Moore (2002) seem to call into question the standard analysis of raising within Head-driven Phrase Structure Grammar (HPSG): In Russian, the case marking of the raising target and raising pivot does not seem to be shared. In this paper, we show that the phenomena described by Perlmutter and Moore can receive another analysis, fully compatible with HPSG's theory of raising. We argue in addition that our account leads to a slightly simpler model of the Russian data than Perlmutter and Moore's. Crucially, our analysis is only available if we avail ourselves of a rich network of language-specific constructional schemata, a stance recently advocated within HPSG, following the lead of Construction Grammar.
Linking in constructions
(2004)
In this paper I will make an attempt to show how the linking normally done in the lexicon also can be done in constructions. The motivation behind this is the flexibility it gives the grammar writer in underspecifying lexical entries. Being too rigid about linking in the lexicon may lead to unsatisfying results such as multiple lexical entries for what one intuitively feels is just one lexical entry, or alternatively, lexical rules which are not morphologically motivated. The aim is to show that this can be avoided by letting constructions introduce the linking information instead.
We present a constraint-based syntax-semantics interface for the construction of RMRS (Robust Minimal Recursion Semantics) representations from shallow grammars. The architecture is designed to allow modular interfaces to existing shallow grammars of various depth - ranging from chunk grammars to context-free stochastic grammars. We define modular semantics construction principles in a typed feature structure formalism that allow flexible adaptation to alternative grammars and different languages.
Recent analyses of mismatches at the syntax-semantics interface investigate e.g. modification of agentive nouns (Larson, 1998), modification of quantifying pronouns (Abney, 1987), or recursive modification (Kasper, to appear). Each of these analyses is tailored to a specific set of data, and it is not immediately obvious how they could be generalised to cover a larger set of data. I propose a unified analysis for these mismatches that attempts to bring out their common ground. This analysis shares some of its basic intuitions with the one of Kasper, but is more general because the mismatches are handled locally in the CONT feature. Its pivot is an elaborate syntax-semantics interface that is based on a surface-oriented syntactic analysis. This analysis generalises easily to the mismatches at the morphology-semantics interface for German separable-prefix verbs that were discussed in (Müller, 2003).
Negation and negative indefinites raise problems for the principle of compositionality of meaning, because we find both double and single negation readings in natural languages. De Swart and Sag (2002) solve the compositionality problem in a polyadic quantifier framework. The syntax-semantics interface exploits an extension of the Cooper storage mechanism that HPSG uses to account for scope ambiguities. In de Swart and Sag (2002), all negative quantifiers are collected into an N-store, and are interpreted by means of iteration (double negation) or resumption (negative concord) upon retrieval. This puts the ambiguity between single and double negation readings in the grammar, rather than in the lexical items. This paper extends the earlier analysis with a typology of negation and negative indefinites using bi-directional optimality theory (OT). The constraints defined are universal, but their ranking varies from one language to the next. In negative concord languages, the functional motivation for the marking of 'negative variables' wins out, so we use n-words. Double negation languages value first-order iteration, so we use plain indefinites or negative polarity items within the scope of negation. The bi-directional set-up is essential, for syntactic and semantic variation go hand in hand.
Linearization-based HPSG theories are widely used for analyzing languages with relatively free constituent order. This paper introduces the Generalized ID/LP (GIDLP) grammar format, which supports a direct encoding of such theories, and discusses key aspects of a parser that makes use of the dominance, precedence, and linearization domain information explicitly encoded in this grammar format. We show that GIDLP grammars avoid the explosion in the number of rules required under a traditional phrase structure analysis of free constituent order. As a result, GIDLP grammars supportmore modular and compact grammar encodings and require fewer edges in parsing.
In this paper, I shall discuss the semantic attachment of intersective modifiers in German coherent constructions. I shall show that a purely syntactic solution to the observable attachment ambiguity is undesirable for reasons of processing e ciency and/or massive spurious ambiguity. Instead, I shall follow Egg and Lebeth (1995) and propose an extension to Minimal Recursion Semantics, permitting the expression of underspecified semantic attachment. This rather trivial move, as we shall see, will not only be preferable for processing reasons, but it will also be more in line with the spirit of underspecified semantics, e ectively providing a compact representation of purely semantic distinctions, instead of unfolding these distinctions into a rain forest of tree representations and derivations. I will present an implementation of the underspecification approach integrated into the German HPSG developed at DFKI and compare its e ciency to an alternative implementation where semantic attachment is unfolded by means of retrieval rules.