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)
U radu se daje pregled problema povezanih s normativnim statusom čestičnih/vezničkih skupina da li, je li i čestice/veznika li. Pokazuje se da postoji nekoliko pogrješaka povezanih s tumačenjem normativnog statusa i raspodjele tih skupina i te čestice te se provjerava normativno pravilo prema kojemu skupinu da li treba u standardnome jeziku zamijeniti česticom li (o tome se posve pogrješno često piše kao o zamjeni da li s je li, a skupina je li, s iznimkom skupine je li da koja ima funkciju dopunskoga pitanja, u standardnome jeziku ne postoji kao čestična/veznička skupina jer je njezin prvi član uvijek 3. lice prezenta glagola biti). Određuje se normativni status skupine je li, tj. pokazuje se da je ona u hrvatskome jeziku ili zastarjela ili da pripada razgovornomu stilu. Također se provjeravaju pravila u skladu s kojima se normativni status skupine da li u izravnome pitanju razlikuje od njezina statusa u neizravnome pitanju i prema kojima se skupina da li i u standardnome jeziku pojavljuje pri izricanju potvrdnosti te u alternativnim pitanjima. Donose se uvjeti zamjenjivosti skupina da li česticom/veznikom li, tj. izdvajaju se sintaktički konteksti u kojima ta zamjena nije potrebna ili nije moguća.
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.
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.
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.