Results 81 to 90 of about 22,181 (225)
Constraint-based computational semantics : a comparison between LTAG and LRS [PDF]
, 2006 This paper compares two approaches to computational semantics, namely semantic unification in Lexicalized Tree Adjoining Grammars (LTAG) and Lexical Resource Semantics (LRS) in HPSG.
Kallmeyer, Laura, Richter, Frank
core
, 1995 DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two composition operations called subsertion and sister-adjunction.
Rambow, Owen +2 more
core +2 more sources
A Tractable Extension of Linear Indexed Grammars [PDF]
, 1995 It has been shown that Linear Indexed Grammars can be processed in polynomial time by exploiting constraints which make possible the extensive use of structure-sharing.
Keller, Bill, Weir, David
core +4 more sources
Factoring Predicate Argument and Scope Semantics : underspecified Semantics with LTAG [PDF]
, 2003 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 ...
Joshi, Aravind K., Kallmeyer, Laura
core +1 more source
Anaphora and Discourse Structure [PDF]
, 2002 We argue in this paper that many common adverbial phrases generally taken to signal a discourse relation between syntactically connected units within discourse structure, instead work anaphorically to contribute relational meaning, with only indirect ...
Joshi, Aravind +3 more
core +2 more sources
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 ...
Yves Schabes, Aravind K. Joshi
openaire +2 more sources
Strong Learning of Probabilistic Tree Adjoining Grammars
, 2021 Alexander Clark
openalex +1 more source
Incremental, Predictive Parsing with Psycholinguistically Motivated Tree-Adjoining Grammar
Computational Linguistics, 2021 Vera Demberg +2 more
doaj +1 more source
Separating Dependency from Constituency in a Tree Rewriting System
, 1997 In this paper we present a new tree-rewriting formalism called Link-Sharing Tree Adjoining Grammar (LSTAG) which is a variant of synchronous TAGs. Using LSTAG we define an approach towards coordination where linguistic dependency is distinguished from ...
Sarkar, Anoop
core +3 more sources