Results 51 to 60 of about 29,707 (219)

LFG and Tree-Adjoining Grammar

open access: yes, 2023
This chapter gives an introduction to Tree-Adjoining Grammar (TAG) and draws some comparisons with Lexical Functional Grammar (LFG). It is primarily aimed at those familiar with LFG who are looking to learn about TAG and see where the two formalisms differ\slash overlap, but the comparisons will also be of interest to those coming from a TAG ...
openaire   +2 more sources

TRAINING TREE ADJOINING GRAMMARS WITH HUGE TEXT CORPUS USING SPARK MAP REDUCE [PDF]

open access: yesICTACT Journal on Soft Computing, 2015
Tree adjoining grammars (TAGs) are mildly context sensitive formalisms used mainly in modelling natural languages. Usage and research on these psycho linguistic formalisms have been erratic in the past decade, due to its demanding construction and ...
Vijay Krishna Menon   +2 more
doaj  

Syntax-driven semantic frame composition in Lexicalized Tree Adjoining Grammars

open access: yesJournal of Language Modelling, 2014
The grammar framework presented in this paper combines Lexicalized Tree Adjoining Grammar (LTAG) with a (de)compositional frame semantics. We introduce elementary constructions as pairs of elementary LTAG trees and decompositional frames.
Laura Kallmeyer, Rainer Osswald
doaj   +1 more source

Some computational properties of Tree Adjoining Grammars [PDF]

open access: yesProceedings 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

open access: yesZeitschrift 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

Bidirectional parsing of lexicalized tree adjoining grammars [PDF]

open access: yesProceedings 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

A case study in underspecification of UG: External Pair Merge of v and T

open access: yesSyntax, 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

TuLiPA : a syntax-semantics parsing environment for mildly context-sensitive formalisms [PDF]

open access: yes, 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

Just pair‐merge

open access: yesSyntax, 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

Home - About - Disclaimer - Privacy