Results 11 to 20 of about 21,874 (220)
Tree adjoining grammars mit Unifikation [PDF]
, 1991 Tree Adjoining Grammars (TAGs) - as used in the parsing algorithm of Harbusch - can be improved with respect to compactness and transparency for the task of grammar design.
Buschauer, Béla +3 more
core +4 more sources
Parsing French with Tree Adjoining Grammar [PDF]
Proceedings of the 12th conference on Computational linguistics -, 1988 We present the first sizable grammar written for TAG. We present the linguistic coverage of our grammar, and explain the linguistic reasons which lead us to choose the particular representations. We show that TAG formalism provides sufficient constraints for handling most of the linguistic phenomena, with minimal linguistic stipulations. We first state
Anne Abeillé
openalex +3 more sources
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,
K. Vijay-Shankar, Aravind K. Joshi
openalex +3 more sources
Generation and synchronous tree‐adjoining grammars [PDF]
Computational Intelligence, 1991 Tree‐adjoining grammars (TAG) have been proposed as a formalism for generation based on the intuition that the extended domain of syntactic locality that TAGs provide should aid in localizing semantic dependencies as well, in turn serving as an aid to generation from semantic representations.
Stuart M. Shieber, Yves Schabes
openalex +4 more sources
Prefix Probabilities from Stochastic Tree Adjoining Grammars [PDF]
Proceedings of the 36th annual meeting on Association for Computational Linguistics -, 1998 7 pages, 2 Postscript figures, uses colacl.sty, graphicx.sty, psfrag ...
Mark-Jan Nederhof +2 more
openalex +5 more sources
A syntax-semantics interface for Tree-Adjoining Grammars through Abstract Categorial Grammars
Journal of Language Modelling, 2018 We present a model of the syntax-semantics interface for Tree-Adjoining Grammars (TAGs). It is based on the encoding of TAGs within the framework of Abstract Categorial Grammars (ACGs).
Sylvain Pogodalla
doaj +3 more sources
Portuguese analysis with Tree Adjoining Grammars [PDF]
Proceedings of the 15th conference on Computational linguistics -, 1994 This article approaches syntactical analysis of Portuguese language based upon a formalism called Tree Adjoining Grammars (TAGs) [JOSHI 85]. It briefly describes the formalism and its main operations, outlines a Portuguese subset for analysis, and presents a parser developed according TAGs concepts in order to validate an application of the formalism ...
Karin Kipper, Vera Lúcia Strube de Lima
openalex +2 more sources
Stochastic lexicalized tree-adjoining grammars [PDF]
Proceedings of the 14th conference on Computational linguistics -, 1992 The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is formally defined. The parameters of a SLTAG correspond to the probability of combining two structures each one associated with a word. The characteristics of SLTAG are unique and novel since it is lexieally sensitive (as N-gram models or Hidden Markov Models) and yet hierarchical ...
Yves Schabes
openalex +3 more sources
A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars [PDF]
, 2014 International audienceNeg-Raising (NR) verbs form a class of verbs with a clausal complement that show the following behavior: when a negation syntactically attaches to the matrix predicate, it can semantically attach to the embedded predicate.
Laurence Danlos +2 more
openalex +5 more sources
Constraining Tree Adjoining Grammars by unification [PDF]
Proceedings of the 13th conference on Computational linguistics -, 1990 In a proposal, Vijay-Shanker and Joshi presented a definition for combining the two formalisms Tree Adjoining Grammars and PATR unification. The essential idea for that combination is the separation of the two recursion operations - adjoining and unification - to preserve all properties of both formalisms which is not desirable for natural language ...
Karin Harbusch
openalex +3 more sources