Linguistik-Klassifikation
Refine
Year of publication
Document Type
- Preprint (48)
- Conference Proceeding (19)
- Part of a Book (9)
- Article (8)
- Book (5)
- Working Paper (4)
Language
- English (93) (remove)
Has Fulltext
- yes (93)
Is part of the Bibliography
- no (93)
Keywords
- Computerlinguistik (33)
- Japanisch (15)
- Deutsch (13)
- Syntaktische Analyse (9)
- Maschinelle Übersetzung (8)
- Multicomponent Tree Adjoining Grammar (8)
- Lexicalized Tree Adjoining Grammar (5)
- Semantik (5)
- Satzanalyse (4)
- Transkription (4)
- German (3)
- Grammatik (3)
- Range Concatenation Grammar (3)
- Software (3)
- Syntax (3)
- Tree Adjoining Grammar (3)
- Dialog (2)
- Englisch (2)
- Frage (2)
- Grammaires d’Arbres Adjoints (2)
- Höflichkeitsform (2)
- Kongress (2)
- MCTAG (2)
- Numerale (2)
- Suchmaschine (2)
- Tree Adoining Grammar (2)
- Tree Description Grammar (2)
- speech tagging (2)
- Akustische Phonetik (1)
- Arabisch (1)
- Artikulatorische Phonetik (1)
- Auditive Phonetik (1)
- Automatentheorie (1)
- Automatische Spracherkennung (1)
- Automatische Sprachproduktion (1)
- Benutzeroberfläche (1)
- Chinesisch (1)
- Computersimulation (1)
- Coreference annotation (1)
- Datenstruktur (1)
- Description Tree Grammar (1)
- Experimentelle Phonetik (1)
- Formale Sprache (1)
- Formalismes syntaxiques (1)
- Fremdsprache (1)
- Fuzzy-Logik (1)
- Gebärdensprache (1)
- Generic NLP Architecture (1)
- Gesprochene Sprache (1)
- HPSG Parsing (1)
- Head-driven phrase structure grammar (1)
- IE (1)
- Implementierung <Informatik> (1)
- Korean (1)
- Koreanisch (1)
- Korpus <Linguistik> (1)
- LTAG (1)
- Lautsprache (1)
- Lexical Resource Semantics (1)
- Lexical Ressource Semantics (1)
- Minimal Recursion Semantics (1)
- Mittelchinesisch (1)
- Morphologie (1)
- Numerus (1)
- Online-Publikation (1)
- Ontologie <Wissensverarbeitung> (1)
- Partikel (1)
- Präposition (1)
- Romanian (1)
- Rumänisch (1)
- SYNtax-based Reference Annotation (1)
- Satzanlyse (1)
- Shallow NLP (1)
- Simple Range Concatenation Grammar (1)
- Sloppiness (1)
- Spracherwerb (1)
- Syntactic formalisms (1)
- TUSNELDA (1)
- Tarragona <2008> (1)
- Tree-Adjoining Grammar (1)
- Tübingen <2007> (1)
- Unordered Vector Grammar with Dominance Link (1)
- Unterspezifikation (1)
- Vagheit (1)
- Vagueness (1)
- Visualisierung (1)
- Word Sense Disambiguation (1)
- XML (1)
- allemand (1)
- brouillage d’arguments (1)
- chunk parsing (1)
- computational semantics (1)
- coréen (1)
- formalismes grammaticaux (1)
- german (1)
- grammaires d’arbres (1)
- grammar formalism (1)
- lexicalized tree-adjoining grammar (1)
- memory-based learning (1)
- metagrammars (1)
- multicomponent rewriting (1)
- métagrammaires (1)
- ordre des mots (1)
- quantifier scope (1)
- robust parsing (1)
- role labeling (1)
- scrambling (1)
- similarity-based learning (1)
- time annotation (1)
- tree-based grammars (1)
- treebanking (1)
- underspecification (1)
- word order (1)
Institute
- Extern (80)
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.
In this paper we will explore the similarities and differences between two feature logic-based approaches to the composition of semantic representations. The first approach is formulated for Lexicalized Tree Adjoining Grammar (LTAG, Joshi and Schabes 1997), the second is Lexical Ressource Semantics (LRS, Richter and Sailer 2004) and was first defined in Head-driven Phrase Structure Grammar. The two frameworks have several common characteristics that make them easy to compare: 1 They use languages of two sorted type theory for semantic representations. 2. They allow underspecification. LTAG uses scope constraints while LRS provides component-of contraints. 3 They use feature logics for computing semantic representations. 4. they are designed for computational applications. By comparing the two frameworks we will also point outsome characteristics and advantages of feature logic-based semantic computation in genereal.
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.
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.
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.