Linguistik
Refine
Year of publication
Document Type
- Article (1214)
- Part of a Book (784)
- Conference Proceeding (583)
- Working Paper (254)
- Review (181)
- Preprint (122)
- Book (108)
- Part of Periodical (64)
- Report (58)
- Doctoral Thesis (23)
Language
- English (1815)
- German (1061)
- Croatian (298)
- Portuguese (120)
- Turkish (43)
- Multiple languages (25)
- French (21)
- mis (16)
- Spanish (7)
- Polish (4)
Keywords
- Deutsch (437)
- Syntax (152)
- Linguistik (130)
- Englisch (123)
- Semantik (112)
- Spracherwerb (97)
- Phonologie (86)
- Rezension (77)
- Kroatisch (68)
- Fremdsprachenlernen (67)
Institute
- Extern (438)
- Institut für Deutsche Sprache (IDS) Mannheim (113)
- Neuere Philologien (43)
- Sprachwissenschaften (43)
- Universitätsbibliothek (5)
- Sprach- und Kulturwissenschaften (3)
- Gesellschaftswissenschaften (2)
- Medizin (2)
- Präsidium (2)
- SFB 268 (2)
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.
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.
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.
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.
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.
Multicomponent Tree Adjoining Grammars (MCTAGs) are a formalism that has been shown to be useful for many natural language applications. The definition of non-local 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. 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. We provide similar characterizations for various types of MCTAG. These characterizations give a better understanding of the formalisms, they allow a more systematic comparison of different types of MCTAG, and, furthermore, they can be exploited for parsing.
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.
Eine Studie zur fehleranalytischen Kompetenz der Studierenden in der Deutschlehrendenausbildung
(2018)
Die Fehleranalyse gilt seit langem als eine wertvolle Hilfe beim Fremdsprachenunterricht, weil sowohl Lernende als auch Lehrende dadurch wichtige Informationen über den Spracherwerbsprozess bekommen können. Auch die vorliegende Arbeit beabsichtigt mit Hilfe der Fehleranalyse zu Erkenntnissen über die fehleranalytische Kompetenz der künftigen Deutschlehrer zu gelangen. Ausgangspunkt dieser Studie war die Frage, ob es eine direkte Verbindung zwischen dem Sprachniveau und der fehleranalytischen Kompetenz der Studierenden gebe. An der Untersuchung haben 37 Studierenden der Gazi Universität teilgenommen, von denen sieben Rückkehrende aus Deutschland waren und über gute Sprachkenntnisse verfügten. Alle Probanden befanden sich im sechsten Semester und hatten sich im Rahmen der angewandten Linguistik ein semesterlang mit der Fehleranalyse befasst. Den Probanden wurden zwei Texte vorgelegt, deren Fehler sie identifizieren und anhand eines Rasters klassifizieren mussten. Es hat sich herausgestellt, dass bei der Fehleridentifizierung die Fremdsprachenkenntnisse ein entscheidender Faktor waren. Bei der Fehlerklassifizierung dagegen, schienen die Fremdsprachenkenntnisse eher eine untergeordnete Rolle zu spielen.
Department of British and American Studies in cooperation with SKASE (The Slovak Association for the Study of English) organized the Word-Formation Theories III & Typology and Universals in Word-Formation IV Conference. The Conference took place at P.J. Šafárik University in Košice, Slovakia, from 27 June to 30 June 2018. The event was organized by Slávka Tomaščíková, Lívia Körtvélyessy and Pavol Štekauer (P.J. Šafárik University in Košice, Slovakia) and with the support of the APVV project No: APVV-16–0035 Research into extralinguistic factors of word-formation and word-interpretation. The program and the book of abstracts are available at the conference homepage http://kaa.ff.upjs.sk/en/alumni-club/33/word-formation-theories-iii-typology-and-universals-in-word-formation-iv.