Refine
Year of publication
Document Type
- Article (1108)
- Book (639)
- Part of a Book (421)
- Part of Periodical (133)
- Report (94)
- Preprint (82)
- Conference Proceeding (71)
- Other (59)
- Review (57)
- Working Paper (46)
Language
Has Fulltext
- yes (2738) (remove)
Keywords
- Mosambik (121)
- Mozambique (121)
- Moçambique (120)
- Rezension (87)
- Bibel (66)
- Christentum (63)
- bible (63)
- christianity (63)
- Literatur (57)
- Aufsatzsammlung (54)
Institute
- Extern (2738) (remove)
In syntax, the trend nowadays is towards lexicalized grammar formalisms. It is now widely accepted that dividing words into wordclasses may serve as a laborsaving mechanism - but at the same time, it discards all detailed information on the idiosyncratic behavior of words. And that is exactly the type of information that may be necessary in order to parse a sentence. For learning approaches, however, lexicalized grammars represent a challenge for the very reason that they include so much detailed and specific information, which is difficult to learn. This paper will present an algorithm for learning a link grammar of German. The problem of data sparseness is tackled by using all the available information from partial parses as well as from an existing grammar fragment and a tagger. This is a report about work in progress so there are no representative results available yet.
This paper presents a comparative study of probabilistic treebank parsing of German, using the Negra and TüBa-D/Z treebanks. Experiments with the Stanford parser, which uses a factored PCFG and dependency model, show that, contrary to previous claims for other parsers, lexicalization of PCFG models boosts parsing performance for both treebanks. The experiments also show that there is a big difference in parsing performance, when trained on the Negra and on the TüBa-D/Z treebanks. Parser performance for the models trained on TüBa-D/Z are comparable to parsing results for English with the Stanford parser, when trained on the Penn treebank. This comparison at least suggests that German is not harder to parse than its West-Germanic neighbor language English.
How to compare treebanks
(2008)
Recent years have seen an increasing interest in developing standards for linguistic annotation, with a focus on the interoperability of the resources. This effort, however, requires a profound knowledge of the advantages and disadvantages of linguistic annotation schemes in order to avoid importing the flaws and weaknesses of existing encoding schemes into the new standards. This paper addresses the question how to compare syntactically annotated corpora and gain insights into the usefulness of specific design decisions. We present an exhaustive evaluation of two German treebanks with crucially different encoding schemes. We evaluate three different parsers trained on the two treebanks and compare results using EVALB, the Leaf-Ancestor metric, and a dependency-based evaluation. Furthermore, we present TePaCoC, a new testsuite for the evaluation of parsers on complex German grammatical constructions. The testsuite provides a well thought-out error classification, which enables us to compare parser output for parsers trained on treebanks with different encoding schemes and provides interesting insights into the impact of treebank annotation schemes on specific constructions like PP attachment or non-constituent coordination.
In the last decade, the Penn treebank has become the standard data set for evaluating parsers. The fact that most parsers are solely evaluated on this specific data set leaves the question unanswered how much these results depend on the annotation scheme of the treebank. In this paper, we will investigate the influence which different decisions in the annotation schemes of treebanks have on parsing. The investigation uses the comparison of similar treebanks of German, NEGRA and TüBa-D/Z, which are subsequently modified to allow a comparison of the differences. The results show that deleted unary nodes and a flat phrase structure have a negative influence on parsing quality while a flat clause structure has a positive influence.
Transforming constituent-based annotation into dependency-based annotation has been shown to work for different treebanks and annotation schemes (e.g. Lin (1995) has transformed the Penn treebank, and Kübler and Telljohann (2002) the Tübinger Baumbank des Deutschen (TüBa-D/Z)). These ventures are usually triggered by the conflict between theory-neutral annotation, that targets most needs of a wider audience, and theory-specific annotation, that provides more fine-grained information for a smaller audience. As a compromise, it has been pointed out that treebanks can be designed to support more than one theory from the start (Nivre, 2003). We argue that information can also be added to an existing annotation scheme so that it supports additional theory-specific annotations. We also argue that such a transformation is useful for improving and extending the original annotation scheme with respect to both ambiguous annotation and annotation errors. We show this by analysing problems that arise when generating dependency information from the constituent-based TüBa-D/Z.
Chunk parsing has focused on the recognition of partial constituent structures at the level of individual chunks. Little attention has been paid to the question of how such partial analyses can be combined into larger structures for complete utterances. Such larger structures are not only desirable for a deeper syntactic analysis. They also constitute a necessary prerequisite for assigning function-argument structure. The present paper offers a similaritybased algorithm for assigning functional labels such as subject, object, head, complement, etc. to complete syntactic structures on the basis of prechunked input. The evaluation of the algorithm has concentrated on measuring the quality of functional labels. It was performed on a German and an English treebank using two different annotation schemes at the level of function argument structure. The results of 89.73% correct functional labels for German and 90.40%for English validate the general approach.
In this paper, we investigate the role of sub-optimality in training data for part-of-speech tagging. In particular, we examine to what extent the size of the training corpus and certain types of errors in it affect the performance of the tagger. We distinguish four types of errors: If a word is assigned a wrong tag, this tag can belong to the ambiguity class of the word (i.e. to the set of possible tags for that word) or not; furthermore, the major syntactic category (e.g. "N" or "V") can be correctly assigned (e.g. if a finite verb is classified as an infinitive) or not (e.g. if a verb is classified as a noun). We empirically explore the decrease of performance that each of these error types causes for different sizes of the training set. Our results show that those types of errors that are easier to eliminate have a particularly negative effect on the performance. Thus, it is worthwhile concentrating on the elimination of these types of errors, especially if the training corpus is large.
Prepositional phrase (PP) attachment is one of the major sources for errors in traditional statistical parsers. The reason for that lies in the type of information necessary for resolving structural ambiguities. For parsing, it is assumed that distributional information of parts-of-speech and phrases is sufficient for disambiguation. For PP attachment, in contrast, lexical information is needed. The problem of PP attachment has sparked much interest ever since Hindle and Rooth (1993) formulated the problem in a way that can be easily handled by machine learning approaches: In their approach, PP attachment is reduced to the decision between noun and verb attachment; and the relevant information is reduced to the two possible attachment sites (the noun and the verb) and the preposition of the PP. Brill and Resnik (1994) extended the feature set to the now standard 4-tupel also containing the noun inside the PP. Among many publications on the problem of PP attachment, Volk (2001; 2002) describes the only system for German. He uses a combination of supervised and unsupervised methods. The supervised method is based on the back-off model by Collins and Brooks (1995), the unsupervised part consists of heuristics such as ”If there is a support verb construction present, choose verb attachment”. Volk trains his back-off model on the Negra treebank (Skut et al., 1998) and extracts frequencies for the heuristics from the ”Computerzeitung”. The latter also serves as test data set. Consequently, it is difficult to compare Volk’s results to other results for German, including the results presented here, since not only he uses a combination of supervised and unsupervised learning, but he also performs domain adaptation. Most of the researchers working on PP attachment seem to be satisfied with a PP attachment system; we have found hardly any work on integrating the results of such approaches into actual parsers. The only exceptions are Mehl et al. (1998) and Foth and Menzel (2006), both working with German data. Mehl et al. report a slight improvement of PP attachment from 475 correct PPs out of 681 PPs for the original parser to 481 PPs. Foth and Menzel report an improvement of overall accuracy from 90.7% to 92.2%. Both integrate statistical attachment preferences into a parser. First, we will investigate whether dependency parsing, which generally uses lexical information, shows the same performance on PP attachment as an independent PP attachment classifier does. Then we will investigate an approach that allows the integration of PP attachment information into the output of a parser without having to modify the parser: The results of an independent PP attachment classifier are integrated into the parse of a dependency parser for German in a postprocessing step.
Maschinelles Lernen wird häufig zur effzienten Annotation großer Datenmengen eingesetzt. Die Forschung zu maschinellen Lernverfahren beschränkt sich i.a. darauf unterschiedliche Lernverfahren zu vergelichen oder die optimale größe der Trainingsdaten zu bestimmen. Bisher wurde jedoch nicht untersucht, in wie weit sich linguistisches Wissen bei der Aufgabendefinition positiv auswirken kann. Dies soll hier anhand des Lernens von Base-Nominalphrasen mit drei unterschiedlichen Definitionen untersucht werden. Die Definitionen unterscheiden sich im Grad der linguistisch motivierten Erweiterungen, die zu einer eher praktisch motivierten ersten Definition hinzu kamen. Die Untersuchungen ergaben, dass sich die Anzahl der falsch klasssifizierten Wörter um ein Drittel reduzieren lässt.
This report explores the question of compatibility between annotation projects including translating annotation formalisms to each other or to common forms. Compatibility issues are crucial for systems that use the results of multiple annotation projects. We hope that this report will begin a concerted effort in the field to track the compatibility of annotation schemes for part of speech tagging, time annotation, treebanking, role labeling and other phenomena.
This paper reports on the SYN-RA (SYNtax-based Reference Annotation) project, an on-going project of annotating German newspaper texts with referential relations. The project has developed an inventory of anaphoric and coreference relations for German in the context of a unified, XML-based annotation scheme for combining morphological, syntactic, semantic, and anaphoric information. The paper discusses how this unified annotation scheme relates to other formats currently discussed in the literature, in particular the annotation graph model of Bird and Liberman (2001) and the pie-in-thesky scheme for semantic annotation.
Chunk parsing has focused on the recognition of partial constituent structures at the level of individual chunks. Little attention has been paid to the question of how such partial analyses can be combined into larger structures for complete utterances. The TüSBL parser extends current chunk parsing techniques by a tree-construction component that extends partial chunk parses to complete tree structures including recursive phrase structure as well as function-argument structure. TüSBLs tree construction algorithm relies on techniques from memory-based learning that allow similarity-based classification of a given input structure relative to a pre-stored set of tree instances from a fully annotated treebank. A quantitative evaluation of TüSBL has been conducted using a semi-automatically constructed treebank of German that consists of appr. 67,000 fully annotated sentences. The basic PARSEVAL measures were used although they were developed for parsers that have as their main goal a complete analysis that spans the entire input.This runs counter to the basic philosophy underlying TüSBL, which has as its main goal robustness of partially analyzed structures.
This paper provides an overview of current research on a hybrid and robust parsing architecture for the morphological, syntactic and semantic annotation of German text corpora. The novel contribution of this research lies not in the individual parsing modules, each of which relies on state-of-the-art algorithms and techniques. Rather what is new about the present approach is the combination of these modules into a single architecture. This combination provides a means to significantly optimize the performance of each component, resulting in an increased accuracy of annotation.
A lot of interest has recently been paid to constraint-based definitions and extensions of Tree Adjoining Grammars (TAG). Examples are the so-called quasi-trees, D-Tree Grammars and Tree Description Grammars. The latter are grammars consisting of a set of formulars denoting trees. TDGs are derivation based where in each derivation step a conjunction is built of the old formular, a formular of the grammar and additional equivalences between node names of the two formulars. This formalism is more powerfull than TAGs. TDGs offer the advantages of MC-TAG and D-Tree Grammars for natural languages and they allow underspecification. However the problem is that TDGs might be unnecessarily powerfull for natural languages. To solve this problem, in this paper, I will propose a local TDGs, a restricted version of TDGs. Local TDGs still have the advantages of TDGs but they are semilinear and therefore more appropriate for natural languages. First, the notion of the semilinearity is defined. Then local TDGs are introduced, and, finally, semilinearity of local Tree Description Languages is proven.
This paper proposes a compositional semantics for lexicalized tree adjoining grammars (LTAG). Tree-local multicompnent derivations allow seperation of semantiv contribution of a lexical item into one component contributing to the predicate argument structure and second a component contributing to scope semantics. Based on this idea a syntx-semantics interface is presented where the compositional semantics depends only on the derivation structure. It is shown that the derivation structure allows an appropriate amount of underspecification. This is illustrated by investigating underspecified representations for quantifier scpoe ambiguities and related phenomena such as adjunct scope and island constraints.
A hierarchy of local TDGs
(1998)
Many recent variants of Tree Adoining Grammars (TAG) allow an underspecifiaction of the parent relation between nodes in a tree, i.e. they do not deal with fully specified trees as it is the case with TAGs.Such TAG variants are for example Description Tree Grammars (DTG), Unordered Vector Grammars with Dominance Links (UVG-DL), a definition of TAGs via so-called quasi trees and Tree Description Grammars (TDG. The last TAg variant, local TDG, is an extension of TAG generating Tree Descriptions. Local TDGs even allow an underspecification of the dominance relation between node names and thereby provide the possibility to generate underspecified representations for structural ambiguities such as quantifier scope ambiguities. This abstract deals with formal properties of local TDGs. A hierarchiy of local TDGs is established together with a pumping lemma for local TDGs of a certain rank.
Tree-local MCTAG with shared nodes : an analysis of word order variation in German and Korean
(2004)
Tree Adjoining Grammars (TAG) are known not to be powerful enough to deal with scrambling in free word order languages. The TAG-variants proposed so far in order to account for scrambling are not entirely satisfying. Therefore, an alternative extension of TAG is introduced based on the notion of node sharing. Considering data from German and Korean, it is shown that this TAG-extension can adequately analyse scrambling data, also in combination with extraposition and topicalization.
In this paper, we present an open-source parsing environment (Tübingen Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms. This environment currently supports tree-based grammars (namely Tree-Adjoining Grammars (TAG) and Multi-Component Tree-Adjoining Grammars with Tree Tuples (TT-MCTAG)) and allows computation not only of syntactic structures, but also of the corresponding semantic representations. It is used for the development of a tree-based grammar for German.
This paper proposes a corpus encoding standard that meets the needs of linguistic research using a variety of linguistic data structures. The standard was developed in SFB 441, a research project at the University of Tuebingen. The principal concern of SFB 441 are the empirical data structures which feed into linguistic theory building. SFB 441 consists of several projects, most of which are building corpora to empirically investigate various linguistic phenomena in various languages (e.g. modal verbs in German, forms of address and politeness in Russian). These corpora will form the components of the "Tuebingen collection of reusable, empirical, linguistic data structures (TUSNELDA)". The TUSNELDA annotation standard aims at providing a uniform encoding scheme for all subcorpora and texts of TUSNELDA such that they can be processed with uniform standardized tools. To guarantee maximal reusability we use XML for encoding. Previous SGML standards for text encoding were provided by the Text Encoding Initiative (TEI) and the Expert Advisory Group on Language Engineering Standards (Corpus Encoding Standard, CES). The TUSNELDA standard is based on TEI and XCES (XML version of CES) but takes into account the specific needs of the SFB projects, i.e. the peculiarities of the examined languages and linguistic phenomena.
Existing analyses of German scrambling phenomena within TAG-related formalisms all use non-local variants of TAG. However, there are good reasons to prefer local grammars, in particular with respect to the use of the derivation structure for semantics. Therefore this paper proposes to use local TDGs, a TAG-variant generating tree descriptions that shows a local derivation structure. However the construction of minimal trees for the derived tree descriptions is not subject to any locality constraint. This provides just the amount of non-locality needed for an adequate analysis of scrambling. To illustrate this a local TDG for some German scrambling data is presented.
This paper develops a framework for TAG (Tree Adjoining Grammar) semantics that brings together ideas from different recent approaches.Then, within this framework, an analysis of scope is proposed that accounts for the different scopal properties of quantifiers, adverbs, raising verbs and attitude verbs. Finally, including situation variables in the semantics, different situation binding possibilities are derived for different types of quantificational elements.
This paper presents an LTAG analysis of reflexives like himself and reciprocals like each other. These items need to find a c-commanding antecedent from which they retrieve (part of) their own denotation and with which they syntactically agree. The relation between anaphoric item and antecendent must satisfy the following important locality conditions (Chomsky (1981)).
Relative quantifier scope in German depends, in contrast to English, very much on word order. The scope possibilities of a quantifier are determined by its surface position, its base position and the type of the quantifier. In this paper we propose a multicomponent analysis for German quantifiers computing the scope of the quantifier, in particular its minimal nuclear scope, depending on the syntactic configuration it occurs in.
This paper investigates the relation between TT-MCTAG, a formalism used in computational linguistics, and RCG. RCGs are known to describe exactly the class PTIME; simple RCG even have been shown to be equivalent to linear context-free rewriting systems, i.e., to be mildly context-sensitive. TT-MCTAG has been proposed to model free word order languages. In general, it is NP-complete. In this paper, we will put an additional limitation on the derivations licensed in TT-MCTAG. We show that TT-MCTAG with this additional limitation can be transformed into equivalent simple RCGs. This result is interesting for theoretical reasons (since it shows that TT-MCTAG in this limited form is mildly context-sensitive) and, furthermore, even for practical reasons: We use the proposed transformation from TT-MCTAG to RCG in an actual parser that we have implemented.
This paper sets up a framework for LTAG (Lexicalized Tree Adjoining Grammar) semantics that brings together ideas from different recent approaches addressing some shortcomings of TAG semantics based on the derivation tree. Within this framework, several sample analyses are proposed, and it is shown that the framework allows to analyze data that have been claimed to be problematic for derivation tree based LTAG semantics approaches.
LTAG semantics for questions
(2004)
This papers presents a compositional semantic analysis of interrogatives clauses in LTAG (Lexicalized Tree Adjoining Grammar) that captures the scopal properties of wh- and nonwh-quantificational elements. It is shown that the present approach derives the correct semantics for examples claimed to be problematic for LTAG semantic approaches based on the derivation tree. The paper further provides an LTAG semantics for embedded interrogatives.
This paper addresses the problem ofconstraints for relative quantifier sope, in partiular in inverse linking readings wherecertain scope orders are exluded. We show how to account for such restrictions in the Tree Adjoining Grammar (TAG) framework by adopting a notion offlexible composition. In the semantics we use for TAG we introduce quantifier sets that group quantifiers that are "glued" together in the sense that no other quantifieran scopally intervene between them. Theflexible composition approach allows us to obtain the desired quantifier sets and thereby the desiredconstraints for quantifier sope.
TT-MCTAG lets one abstract away from the relative order of co-complements in the final derived tree, which is more appropriate than classic TAG when dealing with flexible word order in German. In this paper, we present the analyses for sentential complements, i.e., wh-extraction, thatcomplementation and bridging, and we work out the crucial differences between these and respective accounts in XTAG (for English) and V-TAG (for German).
In this paper we propose a compositional semantics for lexicalized tree-adjoining grammar (LTAG). Tree-local multicomponent derivations allow separation of the semantic contribution of a lexical item into one component contributing to the predicate argument structure and a second component contributing to scope semantics. Based on this idea a syntax-semantics interface is presented where the compositional semantics depends only on the derivation structure. It is shown that the derivation structure (and indirectly the locality of derivations) allows an appropriate amount of underspecification. This is illustrated by investigating underspecified representations for quantifier scope ambiguities and related phenomena such as adjunct scope and island constraints.
In this paper, we introduce an extension of the XMG system (eXtensibleMeta-Grammar) in order to allow for the description of Multi-Component Tree Adjoining Grammars. In particular, we introduce the XMG formalism and its implementation, and show how the latter makes it possible to extend the system relatively easily to different target formalisms, thus opening the way towards multi-formalism.
Developing linguistic resources, in particular grammars, is known to be a complex task in itself, because of (amongst others) redundancy and consistency issues. Furthermore some languages can reveal themselves hard to describe because of specific characteristics, e.g. the free word order in German. In this context, we present (i) a framework allowing to describe tree-based grammars, and (ii) an actual fragment of a core multicomponent tree-adjoining grammar with tree tuples (TT-MCTAG) for German developed using this framework. This framework combines a metagrammar compiler and a parser based on range concatenation grammar (RCG) to respectively check the consistency and the correction of the grammar. The German grammar being developed within this framework already deals with a wide range of scrambling and extraction phenomena.
Cet article étudie la relation entre les grammaires darbres adjoints à composantes multiples avec tuples darbres (TT-MCTAG), un formalisme utilisé en linguistique informatique, et les grammaires à concaténation dintervalles (RCG). Les RCGs sont connues pour décrire exactement la classe PTIME, il a en outre été démontré que les RCGs « simples » sont même équivalentes aux systèmes de réécriture hors-contextes linéaires (LCFRS), en dautres termes, elles sont légèrement sensibles au contexte. TT-MCTAG a été proposé pour modéliser les langages à ordre des mots libre. En général ces langages sont NP-complets. Dans cet article, nous définissons une contrainte additionnelle sur les dérivations autorisées par le formalisme TT-MCTAG. Nous montrons ensuite comment cette forme restreinte de TT-MCTAG peut être convertie en une RCG simple équivalente. Le résultat est intéressant pour des raisons théoriques (puisqu’il montre que la forme restreinte de TT-MCTAG est légèrement sensible au contexte), mais également pour des raisons pratiques (la transformation proposée ici a été utilisée pour implanter un analyseur pour TT-MCTAG).
This paper compares two approaches to computational semantics, namely semantic unification in Lexicalized Tree Adjoining Grammars (LTAG) and Lexical Resource Semantics (LRS) in HPSG. There are striking similarities between the frameworks that make them comparable in many respects. We will exemplify the differences and similarities by looking at several phenomena. We will show, first of all, that many intuitions about the mechanisms of semantic computations can be implemented in similar ways in both frameworks. Secondly, we will identify some aspects in which the frameworks intrinsically differ due to more general differences between the approaches to formal grammar adopted by LTAG and HPSG.
The work presented here addresses the question of how to determine whether a grammar formalism is powerful enough to describe natural languages. The expressive power of a formalism can be characterized in terms of i) the string languages it generates (weak generative capacity (WGC)) or ii) the tree languages it generates (strong generative capacity (SGC)). The notion of WGC is not enough to determine whether a formalism is adequate for natural languages. We argue that even SGC is problematic since the sets of trees a grammar formalism for natural languages should be able to generate is difficult to determine. The concrete syntactic structures assumed for natural languages depend very much on theoretical stipulations and empirical evidence for syntactic structures is rather hard to obtain. Therefore, for lexicalized formalisms, we propose to consider the ability to generate certain strings together with specific predicate argument dependencies as a criterion for adequacy for natural languages.
In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range Concatenation Grammar (RCG). Furthermore, for tree-based grammars, the parser computes not only syntactic analyses but also the corresponding semantic representations.
Multicomponent Tree Adjoining Grammars (MCTAG) is a formalism that has been shown to be useful for many natural language applications. The definition of MCTAG however is problematic since it refers to the process of the derivation itself: a simultaneity constraint must be respected concerning the way the members of the elementary tree sets are added. Looking only at the result of a derivation (i.e., the derived tree and the derivation tree), this simultaneity is no longer visible and therefore cannot be checked. I.e., this way of characterizing MCTAG does not allow to abstract away from the concrete order of derivation. Therefore, in this paper, we propose an alternative definition of MCTAG that characterizes the trees in the tree language of an MCTAG via the properties of the derivation trees the MCTAG licences.
Multicomponent Tree Adjoining Grammars (MCTAG) is a formalism that has been shown to be useful for many natural language applications. The definition of MCTAG however is problematic since it refers to the process of the derivation itself: a simultaneity constraint must be respected concerning the way the members of the elementary tree sets are added. This way of characterizing MCTAG does not allow to abstract away from the concrete order of derivation. In this paper, we propose an alternative definition of MCTAG that characterizes the trees in the tree language of an MCTAG via the properties of the derivation trees (in the underlying TAG) the MCTAG licences. This definition gives a better understanding of the formalism, it allows a more systematic comparison of different types of MCTAG, and, furthermore, it can be exploited for parsing.
In this paper, we will argue for a novel analysis of the auxiliary alternation in Early English, its development and subsequent loss which has broader consequences for the way that auxiliary selection is looked at cross-linguistically. We will present evidence that the choice of auxiliaries accompanying past participles in Early English differed in several significant respects from that in the familiar modern European languages. Specifically, while the construction with have became a full-fledged perfect by some time in the ME period, that with be was actually a stative resultative, which it remained until it was lost. We will show that this accounts for some otherwise surprising restrictions on the distribution of BE in Early English and allows a better understanding of the spread of HAVE through late ME and EModE. Perhaps more importantly, the Early English facts also provide insight into the genesis of the kind of auxiliary selection found in German, Dutch and Italian. Our analysis of them furthermore suggests a promising strategy for explaining cross-linguistic variation in auxiliary selection in terms of variation in the syntactico-semantic structure of the perfect. In this introductory section, we will first provide some background on the historical situation we will be discussing, then we will lay out the main claims for which we will be arguing in the paper.
In der Stadt Wolfenbüttel wurde 1592 am damaligen Hof der Welfenherzöge von Braunschweig und Lüneburg das erste stehende Theater in Deutschland mit einem festen Ensemble gegründet. Das heutige "Lessingtheater" wurde im klassizistischen Stil erbaut und 1909 eröffnet. Es wird als Bespieltheater betrieben. Zur Zeit bietet der "Kulturbund der Lessingstadt Wolfenbüttel e. V." (gegr. 1946) im Auftrage der Stadt ein Programm von 50 bis 70 Vorstellungen jährlich auf dieser Vollbühne (10 m x 8 m) an mit jetzt ca. 600, später dann ca. 500 Zuschauerplätzen. Dieses Programm setzt sich zusammen aus Tourneetheateraufführungen, aus Gastspielen des Nordharzer Städtebundtheaters Halberstadt/ Quedlinburg und der Landesbühne Rheinland-Pfalz. Zu seinem 100-jährigen Bestehen im Jahr 2009 steht eine umfangreiche und umfassende bauliche Erneuerung an, um das Gebäude den Erfordernissen der Zeit in bühnentechnischer wie architektonischer Hinsicht anzupassen. Die Vorstellungen darüber, wie das Theater zukünftig räumlich gestaltet und ausgestattet und welche bühnentechnische Ausstattung dazu eingerichtet werden sollte, werden seit einiger Zeit in Rat und Verwaltung, bei möglichen Geldgebern sowie in der kulturpolitisch interessierten Öffentlichkeit Wolfenbüttels erörtert.
The retreat of BE as perfect auxiliary in the history of English is examined. Corpus data are presented showing that the initial advance of HAVE was most closely connected to a restriction against BE in past counterfactuals. Other factors which have been reported to favor the spread of HAVE are either dependent on the counterfactual effect, or significantly weaker in comparison. It is argued that the effect can be traced to the semantics of the BE perfect, which denoted resultativity rather than anteriority proper. Related data from other older Germanic and Romance languages are presented, and finally implications for existing theories of auxiliary selection stemming from the findings presented are discussed.
Von 560 in Deutschland nachgewiesenen Arten wurden 555 Arten einer Bewertung unterzogen. Danach sind 289 Arten (52 %) bestandsgefährdet. 227 Arten wurden einer Gefährdungskategorie zugeordnet: 25 Arten zu Kategorie 1 ("vom Aussterben bedroht"), 81 Arten zu Kategorie 2 ("stark gefährdet"), 88 Arten zu Kategorie 3 ("gefährdet"), 33 Arten zu Kategorie G ("Gefährdung unbekannten Ausmaßes"); 24 Arten gelten als "extrem selten" (R) und 43 Arten wurden in die Vorwarnliste (V) aufgenommen. Für 17 Arten sind die "Daten unzureichend" (D) für eine Einstufung. Im Vergleich mit der Fassung von 1998 hat der prozentuale Anteil der in die Rote Liste aufgenommenen Arten nicht abgenommen. Nur 37 % der Arten gelten als derzeit nicht gefährdet. Veränderungen zeigen sich vor allem in unterschiedlichen Einstufungen der Arten. Dies ist teilweise durch die andere Einschätzung der Bestandessituation bedingt, teilweise auch durch die neue Vorgehensweise und Anwendung des vorgegebenen Einstufungsschemas. Bei 59 Arten ergab sich eine im Vergleich zu 1998 günstigere Bestandessituation, 36 Arten finden sich nun in einer höheren Kategorie, weil sich ihre Situation schlechter darstellt als vor 10 Jahren. Hauptursache für den gravierenden Rückgang vieler Arten ist die industrielle Landwirtschaft und der damit einhergehende Verlust artspezfischer Nahrungsquellen und Nistplätze.
The period discussed in this work can be defined with absolute precision: it started on June 3, 1907, when the second Duma was dispersed, and ended on July 19, 1914 (August 1 in the Gregorian calendar), when the war against Germany and Austro-Hungary was proclaimed. This period followed right after the first Russian Revolution, which altered the regime: from unlimited autocracy it became half-parliamentary. Although the revolution was aborted and the tsarist government regained control, several important features characterized the period of 1907- 1914. First of all, there was the very existence of the State Duma – the elected lower house of the Parliament with legislative power; second, the establishment of voluntary associations was eased; third, preliminary censorship was abolished. Thus, public life was characterized by a degree of freedom, such as had never existed in Russia before 1905 and would not exist after October 1917. However, the freedom was relative and very narrow; the government tracked all oppositional or near-oppositional activities and did not hesitate to stop them. The basic tension and mutual suspicion between the authorities and society remained intact and eventually brought the collapse of the regime in 1917. But the revolution of February 1917 was not inevitable. In the period under discussion the interest in politics drastically declined, the Russian political forces became more moderate and the majority sought evolution, rather then revolution as the mechanism for change. ...
Vor einigen Jahren habe ich bereits über die Verbreitung und Ökologie der Seidenbiene Colletes collaris Dours berichtet (Westrich 1997). Diese Art ist in Deutschland extrem selten. Ihr aktueller Verbreitungsschwerpunkt liegt im Kaiserstuhl (Westrich et al. 2000). Die Untersuchungen von Pollenladungen von Weibchen aus dem gesamten Areal hatten gezeigt, daß die Art oligolektisch und auf Asteraceae spezialisiert ist. Als Pollenquellen bisher bekannt geworden sind Aster linosyris, Hieracium umbellatum, Picris hieracioides, Senecio erucifolius, Solidago virgaurea und Carduus acanthoides. Im Jahr 2006 machte ich im Kaiserstuhl ergänzende Beobachtungen zum Blütenbesuch, über die ich hier berichte.
Im Winter 1994/1995 wurden in drei Landschilfbeständen am Bodensee (Aach-Ried, Wollmatinger Ried, Konstanz) 294 Schilfgallen von Lipara lucens (Chloropidae) gesammelt. Davon wurden 223 für die Zucht und 82 für den Laborversuch zur Prüfung der Überfl utungstoleranz ausgewählt. Die gefluteten Gallen wurden entweder ½ Tag, 2 Tage oder 4 Tage bei Außentemperaturen im Februar unter Wasser gesetzt und anschließend mit 141 weiteren Gallen (Kontrolle) in Zuchtgläser verbracht. Neben Lipara lucens wurden folgende Arten aus den Gallen gezogen: Apidae (Bienen): Hylaeus pectoralis, Osmia leucomelana; Sphecidae (Grab wespen): Pemphredon lethifer, Trypoxylon attenuatum; Eumenidae (solitäre Falten wespen): Stenodynerus xanthomelas; Gaster up tionidae (Schmal bauchwespen): Gasteruption assectator, Gasteruption phragmiticola; Chrysi didae (Goldwespen): Chrysis cyanea; Eulophidae: Melittobia acasta. Die dominanten Arten waren: Hylaeus pectoralis and Pemphredon lethifer. Die Unterschiede im Artenspektrum der einzelnen Probeflächen waren teils beträchtlich. Insbesondere die Besiedlung durch Hylaeus pectoralis variierte von Lokalität zu Lokalität. Die stark ruderalisierte Probestelle bei Konstanz-Lindenbühl wies das höchste Artenspektrum auf und Pemphredon lethifer hatte hier die höchste Besiedlungsdichte. Dies deutet auf gestörte Verhältnisse im Vergleich zur Probefläche im Aach-Ried hin, einem weitgehend natürlichen Landröhricht. Sowohl aus den Kontrollgallen als auch aus den gefluteten Gallen sind jeweils mehrere Arten, teils in größerer Zahl geschlüpft. Die Unterschiede in der Schlüpfrate (72,4 % bei den Kontrollgallen, 66,7 % bei einer Flutungsdauer von ½ Tag, 69,3 % bei einer Flutungsdauer von 2 Tagen und 51,7 % bei einer Flutungsdauer von 4 Tagen) erklären sich daraus, daß unterschiedlich viele Gallen nicht besiedelt waren. Dies resultiert demnach nicht aus einem möglichen Einfl uß der Überfl utung. Dies hat sich durch ein nachträgliches Öffnen der Gallen bestätigt. Die Gallenerzeugerin Lipara lucens verträgt eine Überflutung ohne Schädigung ebenso wie ihre Parasitoide. Die als Folgesiedler auftretenden nestbauenden Bienen und Grabwespen sind an die Überfl utung dadurch angepaßt, daß entweder ihre Brutzellen mit spezifi schen Materialien ausgekleidet sind (Hylaeus pectoralis) oder daß die winterliche Diapause in selbstgesponnenen Kokons als Ruhelarve überdauert wird (Pemphredon lethifer, Trypoxylon attenuatum). Daraus resultiert: Eine Überflutung im Winterhalbjahr während eines Zeitraumes von ½ Tag bis zu 4 Tagen beeinflußt die Schlüpfrate der Gallenbesiedler nicht. Diese Aussage gilt streng genommen jedoch nur für die Versuchsbedingungen mit sauberem und stehendem Wasser. Belastetes See- oder Flußwasser hat möglicherweise eine andere Auswirkung auf die Gallenbewohner. Stark fließendes Wasser kann die Schilfgallen abknicken und weg spülen. In den zusammengeschwemmten Genisten sind sie erhöhter Feuchtigkeit, stärkerer Verpilzung und damit einer stärkeren Schädigung ausgesetzt.
Das Pollensammelverhalten von Weibchen von Colletes hederae, die in einem Sandkasten eines Kindergartens von Mössingen, einer Stadt in Südwest-Deutschland nisteten, wurde in den Jahren 2006 und 2007 untersucht. Im Jahr 2006 fand die Entnahme der Pollenproben vom 12. September bis 17. Oktober statt, im Jahr 2007 vom 14. September bis 7. Oktober. Insgesamt wurden 169 Pollenladungen gesammelt und lichtmikroskopisch analysiert. In der ersten Hälfte der Flugzeit des Jahres 2006 enthielten die Pollenladungen außer Hedera helix einen vergleichsweise hohen Anteil von Asteraceae, Fabaceae und insbesondere Colchicaceae. Der Pollentyp mit dem höchsten Anteil war der von Colchicum autumnale, einer Pfl anzenart, die der Autor nie zuvor in der Pollenladung einer Wildbiene gefunden hatte. Um den Pollen dieser Pflanze zu sammeln, flogen die Bienen mindestens 700 m weit über das bebaute Stadtgebiet hinweg ins Offenland, wo die Herbstzeitlose in Streuobstwiesen blühte. Colletes hederae scheint beim Pollensammeln in der Hinsicht fl exibel zu sein, daß dann andere Pollenquellen genutzt werden, wenn die artspezifi sche Pollenquelle nicht zur Verfügung steht. Ein solches Verhalten wurde vom Verfasser auch in Südfrankreich und im Kaiserstuhl beobachtet, wo Odontites luteus sowie Solidago canadensis bzw. Solidago gigantea besammelt wurden. Auch an diesen Lokalitäten war der Efeu zum Zeitpunkt der Beobachtungen noch nicht voll aufgeblüht. Bemerkenswert ist vor allem, daß ausnahmslos alle Weibchen der von mir untersuchten Mössinger Population dann zum Efeu als Pollenquelle wechselten, sobald dieser voll aufgeblüht war (2006) bzw. erst gar nicht an anderen Pflanzen zu sammeln begannen, wenn er zum Zeitpunkt des Beginns der Verproviantierung bereits voll blühte (2007). Dies bestätigt erneut das Phänomen der Oligolektie. Allerdings bleibt ungeklärt, ob die Larven den Pollen anderer Pflanzenfamilien in gleicher Weise verwerten können wie Hedera-Pollen.
Es sind bald fünf und zwanzig Jahre, seit die durch den berühmtesten Civilisten in Süddeutschland veranlaßte Streitfrage über die Nothwendigkeit eines allgemeinen bürgerlichen Rechts für Deutschland eine Spaltung unter den deutschen Rechtslehrern erzeugte, in Folge der sich im Norden unseres Vaterlandes eine geschichtliche Schule konstituierte, und als solche den die Grundansichten derselben nicht theilenden Juristen als den Anhängern einer nicht geschichtlichen sich entgegensetzte. ...
Bände: Zoologie I : Säugethiere : mit sechs und vierzig Tafeln : 1852 Zoologie II : Vögel : 15 Tafeln [ca. 1860] Zoologie III : Amphibien : mit drei und dreissig Tafeln, 1882 Zoologie IV : Flussfische : mit zwanzig Kupfertafeln, 1868 Zoologie V : Insecten und Myriopoden : mit fünf und dreissig Kupfertafeln, 1862 Botanik I. Abtheilung : mit acht und vierzig Tafeln, 1862 Botanik II. Abtheilung : mit dreizehn Tafeln, 1864
Cannabis ist die am meisten verbreitete illegale Droge in der Bundesrepublik Deutschland, ebenso in den meisten Ländern Westeuropas und vielen weiteren Ländern weltweit. In den bundesdeutschen Medien kursieren zum Thema Cannabiskonsum "widersprüchliche und kaum nachvollziehbare Angaben" (Pressemitteilung der Deutschen Hauptstelle für Suchtfragen (DHS) vom 28.07.04). Die Fachstelle Prävention setzt sich mit dieser Informationskampagne zum Thema Cannabis für eine faktenorientierte und sachliche Diskussion ein. ...