Results 11 to 20 of about 29,938 (218)
Conditions on consistency of probabilistic Tree Adjoining Grammars [PDF]
Proceedings of the 36th annual meeting on Association for Computational Linguistics -, 1998 Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting point for the study of such cross-derivational properties is the notion of _consistency_.
Anoop Sarkar
openaire +4 more sources
Capturing CFLs with Tree Adjoining Grammars [PDF]
Proceedings of the 32nd annual meeting on Association for Computational Linguistics -, 1994 We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LCFGs of Schabes and Waters but with considerably less restriction on the form of the grammars.
James Rogers
openaire +5 more sources
Synchronous tree-adjoining grammars [PDF]
Proceedings of the 13th conference on Computational linguistics -, 1990 The unique properties of tree-adjoining grammars (TAG) present a challenge for the application of TAGs beyond the limited confines of syntax, for instance, to the task of semantic interpretation or automatic translation of natural language. We present a variant of TAGs, called synchronous TAGs, which characterize correspondences between languages.
Yves Schabes, Stuart M. Shieber
openaire +4 more sources
Modeling the Induced Action Alternation and the Caused-Motion Construction with Tree Adjoining Grammar (TAG) and Semantic Frames [PDF]
Proceedings of the IWCS 2019 Workshop on Computing Semantics with Types, Frames and Related Structures, 2019 The induced action alternation and the caused-motion construction are two phenomena that allow English verbs to be interpreted as motion-causing events.
Esther Seyffarth
openalex +2 more sources
Disfluencies, language comprehension, and Tree Adjoining Grammars [PDF]
Cognitive Science, 2004 AbstractDisfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research focused on the way that disfluencies affect structure‐building operations during comprehension.
Fernanda Ferreira +2 more
openaire +3 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
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
openaire +4 more sources
Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars [PDF]
, 1995 In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to parsing Lexicalized Tree-Adjoining grammars. The novel aspects are (a) immediate generalization of parses in the training set, (b) generalization over ...
Joshi, Aravind, Srinivas, B.
core +9 more sources
A Lexicalized Tree-Adjoining Grammar for Vietnamese [PDF]
, 2006 In this paper, we present the first sizable grammar built for Vietnamese using LTAG, developed over the past two years, named vnLTAG. This grammar aims at modelling written language and is general enough to be both application- and domain-independent. It
Hong Phuong, L. +3 more
core +7 more sources
Lexical and syntactic rules in a Tree Adjoining Grammar [PDF]
Proceedings of the 28th annual meeting on Association for Computational Linguistics -, 1990 Taking examples from English and French idioms, this paper shows that not only constituent structures rules but also most syntactic rules (such as topicalization, wh-question, pronominalization ...) are subject to lexical constraints (on top of syntactic, and possibly semantic, ones).
Anne Abeillé
openaire +4 more sources