Page: 1 2 3 4 5 6 7 8 9... 12
| 90 |
Phase theory and Tree Adjoining Grammar
|
|
|
|
In: http://www.cog.jhu.edu/faculty/frank/papers/phase-paper-revised.pdf (2005)
|
|
Abstract:
The phase-based approach to grammatical derivation and one rooted in the Tree Adjoining Grammar (TAG) formalism share the idea that the derivation of a complex sentence is divided into separate derivations of local domains. These approaches differ, however, in their treatment of syntactic dependencies spanning across such local domains. Under the phase approach, operations in a higher domain can access the edge of a lower domain in accordance with the Phase Impenetrability Condition. In TAG, one local domain can be inserted within another under the adjoining operation. This difference has important consequences in how the locality properties of syntactic dependencies are explained. In this paper, I systematically compare the explanations for locality effects under phases and TAG. I explore the degree to which the explanations offered by these different approaches generalize across Aand A ′-movement, across different structural contexts, and across the phenomena of displacement and agreement, and whether such generalization is empirically warranted in each case.
|
|
Keyword:
agreement 2; movement; phase theory; syntactic locality; tree adjoining grammar
|
|
URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.7471
http://www.cog.jhu.edu/faculty/frank/papers/phase-paper-revised.pdf
|
|
BASE
|
|
Hide details
|
|
|
| 91 |
Automatically generating tree adjoining grammars from abstract specifications
|
|
|
|
In: http://www.eecis.udel.edu/%7Evijay/papers/fei-ci.pdf (2005)
|
|
BASE
|
|
Show details
|
|
|
| 92 |
Logical Aspects of Computational Linguistics
|
|
|
|
In: LACL: Logical Aspects of Computational Linguistics ; https://hal.archives-ouvertes.fr/hal-01656671 ; Philippe Blache; Edward Stabler; Joan Busquets; Richard Moot. LACL: Logical Aspects of Computational Linguistics, Apr 2005, Bordeaux, France. LNCS (3492), Springer Verlag, 2005, 5th International Conference on Logical Aspects of Computational Linguistics, 978-3-540-31953-5. ⟨10.1007/b136076⟩ ; https://link.springer.com/book/10.1007%2Fb136076 (2005)
|
|
BASE
|
|
Show details
|
|
|
| 95 |
A Broad-Coverage, Representationally Minimalist LFG Parser: Chunks and F-Structures Are Enough
|
|
|
|
In: Schneider, Gerold (2005). A Broad-Coverage, Representationally Minimalist LFG Parser: Chunks and F-Structures Are Enough. In: LFG05, Bergen, Norway, 18 July 2005 - 20 July 2005. (2005)
|
|
BASE
|
|
Show details
|
|
|
Page: 1 2 3 4 5 6 7 8 9... 12 |
|
