Results 61 to 70 of about 21,709 (216)
Some computational properties of Tree Adjoining Grammars [PDF]
Proceedings of the 23rd annual meeting on Association for Computational Linguistics -, 1985 Tree Adjoining Grammar (TAG) is a formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Joshi, Levy, and Takahashi 1975] and by [Joshi, 1983]. A detailed investigation of the linguistic relevance of TAG's has been carried out in [Kroch and Joshi, 1985]. In this paper, we will describe some new results for TAG's,
Aravind K. Jushi, K. Vijay-Shankar
openaire +4 more sources
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
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
Tree-Adjoining Grammars as Abstract Categorial Grammars
, 2002 Philippe de Groote
openaire +3 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
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
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
Structure sharing in lexicalized tree-adjoining grammars [PDF]
Proceedings of the 14th conference on Computational linguistics -, 1992 We present a scheme for efficiently representing a lexicalized tree-adjoining grammar (LTAG). The proposed representational scheme allows for structure-sharing between lexical entries and the trees associated with the lexical items. A compact organization is achieved by organizing the lexicon in a hierarchical fashion and using inheritance as well as ...
Yves Schabes, K. Vijay-Shanker
openaire +2 more sources
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