Results 51 to 60 of about 21,526 (215)
Wo stehen wir in der Grammatiktheorie? Bemerkungen anlässlich eines Buchs von Stefan Müller
Zeitschrift für Sprachwissenschaft, 2012 Stefan Müller’s recent introductory textbook, “Grammatiktheorie”, is an astonishingly comprehensive and insightful survey for beginning students of the present state of syntactic theory.
Sternefeld Wolfgang, Richter Frank
doaj +1 more source
TuLiPA : a syntax-semantics parsing environment for mildly context-sensitive formalisms [PDF]
, 2008 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 ...
Dellert, Johannes +4 more
core +5 more sources
A case study in underspecification of UG: External Pair Merge of v and T
Syntax, EarlyView.Abstract Previous works have explored the options of Pair Merging R and v as well as T and C, respectively, yielding R‐v and T‐C with various consequences. This paper proposes that v and T can yield the complex head v‐T, an amalgam formed by external Pair Merge.
Andreas Blümel
wiley +1 more source
Parsing with Lexicalized Tree Adjoining Grammar
, 1991 Most current linguistic theories give lexical accounts of several phenomena that used to be considered purely syntactic. The information put in the lexicon is thereby increased in both amount and complexity: see, for example, lexical rules in LFG (Kaplan & Bresnan, 1983), GPSG (Gazdar, Klein, Pullum, & Sag, 1985), HPSG (Pollard & Sag, 1987 ...
Schabes, Yves, Joshi, Aravind K
openaire +4 more sources
Bidirectional parsing of lexicalized tree adjoining grammars [PDF]
Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics -, 1991 In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated with a lexical item, called its anchor.
A. Lavelli, SATTA, GIORGIO
openaire +2 more sources
Syntax, EarlyView.Abstract Two structure‐building operations are currently posited in minimalist theory: an operation forming sets (set merge), and an operation forming ordered pairs (pair‐merge). I argue that pair‐merge is sufficient to generate syntactic relations, so set merge, also called simple merge, should be eliminated from syntactic theory on grounds of ...
Ken Safir
wiley +1 more source
Restricting the Weak-Generative Capacity of Synchronous Tree-Adjoining Grammars [PDF]
, 1994 The formalism of synchronous tree-adjoining grammars, a variant of standard tree-adjoining grammars (TAG), was intended to allow the use of TAGs for language transduction in addition to language specification.
Shieber, Stuart M.
core +5 more sources
The syntax of Greek split reciprocals
Syntax, EarlyView.Abstract We provide the first detailed description and analysis of the syntax of the understudied Greek split reciprocal reconstruction. As in other languages, the reciprocal appears to be bipartite consisting of a quantificational distributor (‘the one’) and a reciprocator (‘the other’).
Lefteris Paparounas, Martin Salzmann
wiley +1 more source
Semantic construction in feature-based TAG [PDF]
, 2008 We propose a semantic construction method for Feature-Based Tree Adjoining Grammar which is based on the derived tree, compare it with related proposals and briefly discuss some implementation ...
Gardent, Claire, Kallmeyer, Laura
core
The Acquisition of Recursion: How Formalism Articulates the Child’s Path
Biolinguistics, 2011 We distinguish three kinds of recursion: Direct Recursion (which delivers a ‘conjunction’ reading), Indirect Recursion, and Generalized Transformations. The essential argument is that Direct Recursion captures the first stage of each recursive structure.
Tom W. Roeper
doaj +1 more source