Linguistik
Refine
Year of publication
- 2007 (60) (remove)
Document Type
- Article (42)
- Preprint (7)
- Working Paper (5)
- Part of a Book (3)
- Conference Proceeding (2)
- Report (1)
Has Fulltext
- yes (60)
Is part of the Bibliography
- no (60)
Keywords
- Kroatisch (35)
- Rezensionen (17)
- Kajkavisch (5)
- Familienname (3)
- Lexikographie (3)
- Personennamenkunde (3)
- Geschlechterforschung (2)
- Numerale (2)
- Phraseologie (2)
- Präposition (2)
Institute
- Extern (60) (remove)
We adopt Markert and Nissim (2005)’s approach of using the World Wide Web to resolve cases of coreferent bridging for German and discuss the strength and weaknesses of this approach. As the general approach of using surface patterns to get information on ontological relations between lexical items has only been tried on English, it is also interesting to see whether the approach works for German as well as it does for English and what differences between these languages need to be accounted for. We also present a novel approach for combining several patterns that yields an ensemble that outperforms the best-performing single patterns in terms of both precision and recall.
Du fait de la traite négrière qui a vu des millions d’Africains être déportés aux Amériques, les langues européennes (anglais, espagnol, français, néerlandais, portugais) des colons qui y étaient déjà installés et qui avaient un fort besoin en main-d’oeuvre africaine, ont eu à intégrer à des degrés divers de nombreux mots africains. Les chercheurs qui travaillent sur ces africanismes sont d’accord pour dire que ces mots ont deux grandes origines africaines : bantoue et non-bantoue.
The Conference on Computational Natural Language Learning features a shared task, in which participants train and test their learning systems on the same data sets. In 2007, as in 2006, the shared task has been devoted to dependency parsing, this year with both a multilingual track and a domain adaptation track. In this paper, we define the tasks of the different tracks and describe how the data sets were created from existing treebanks for ten languages. In addition, we characterize the different approaches of the participating systems, report the test results, and provide a first analysis of these results.
Recent approaches to Word Sense Disambiguation (WSD) generally fall into two classes: (1) information-intensive approaches and (2) information-poor approaches. Our hypothesis is that for memory-based learning (MBL), a reduced amount of data is more beneficial than the full range of features used in the past. Our experiments show that MBL combined with a restricted set of features and a feature selection method that minimizes the feature set leads to competitive results, outperforming all systems that participated in the SENSEVAL-3 competition on the Romanian data. Thus, with this specific method, a tightly controlled feature set improves the accuracy of the classifier, reaching 74.0% in the fine-grained and 78.7% in the coarse-grained evaluation.
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.
We investigate methods to improve the recall in coreference resolution by also trying to resolve those definite descriptions where no earlier mention of the referent shares the same lexical head (coreferent bridging). The problem, which is notably harder than identifying coreference relations among mentions which have the same lexical head, has been tackled with several rather different approaches, and we attempt to provide a meaningful classification along with a quantitative comparison. Based on the different merits of the methods, we discuss possibilities to improve them and show how they can be effectively combined.
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.
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)).
Die zielsprachliche Verwendung des Artikels als grammatikalisiertem Mittel der NP-Determination im Deutschen stellt im Zweitspracherwerb besonders für Deutschlernende mit einer artikellosen Muttersprache eine große Schwierigkeit dar. Die vorliegende Arbeit untersucht die NP-Determination auf der Basis eines Spontansprachkorpus, welches Erwerbsdaten einer achtjährigen russischen Deutschlernenden in einer frühen und einer späten Erwerbsphase liefert. Das Ziel der Untersuchung ist, Erkenntnisse über Entwicklungsverlauf, Transferphänomene und insbesondere referenzsemantische und phonologische Determinanten der Artikelwahl zu gewinnen.
Die Familiennamen sind als einziger Bereich der europäischen Sprachen in ihrer ausgeprägten räumlichen Vielfalt noch höchst unzureichend erfasst. Noch sind die geschichtlich gewachsenen Namenlandschaften in erstaunlicher Stabilität erhalten. Sie werden im Bereich der Bundesrepublik Deutschland durch den seit 2005 in Kooperation der Universitäten Freiburg und Mainz in Angriff genommenen und durch die DFG geförderten 'Deutschen Familiennamenatlas' (OFA) auf der Basis von Telefonanschlüssen (Stand 2005) dokumentiert. Im vorliegenden Beitrag werden Vorarbeiten, Ziele, Gesamtanlage des Projekts, Systematik und Repräsentativität der Themenauswahl in den beiden Hauptteilen (grammatischer und lexikalischer Teil) sowie Kriterien und Methoden der inhaltlichen Konzipierung und formalen Gestaltung der Karten und Kommentare vorgestellt und begründet. Aus den genannten Vorarbeiten werden auch schon Perspektiven künftiger Auswertung der in den Datenbanken archivierten Materialien und der im Atlas exemplarisch dokumentierten Strukturen der Namenlandschaften ersichtlich.