Results 11 to 20 of about 21,709 (216)
Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar [PDF]
Computational Linguistics, 2021 Tree-Local Multi-Component Tree-Adjoining Grammar (TL-MCTAG) is an appealing formalism for natural language representation because it arguably allows the encapsulation of the appropriate domain of locality within its elementary structures.
Rebecca Nesson +2 more
doaj +5 more sources
Coordination in Tree Adjoining Grammars [PDF]
Proceedings of the 16th conference on Computational linguistics -, 1996 In this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivation in LTAGs that preserves the notion of fixed constituency in the LTAG lexicon while providing the flexibility needed for coordination phenomena.
Aravind K. Joshi, Anoop Sarkar
core +6 more sources
Anchoring a Lexicalized Tree-Adjoining Grammar for Discourse [PDF]
, 1998 We here explore a ``fully'' lexicalized Tree-Adjoining Grammar for discourse that takes the basic elements of a (monologic) discourse to be not simply clauses, but larger structures that are anchored on variously realized discourse cues. This link with intra-sentential grammar suggests an account for different patterns of discourse cues, while the ...
Webber, Bonnie Lynn, Joshi, Aravind K.
core +9 more sources
Multiple Adjunction in Feature-Based Tree-Adjoining Grammar [PDF]
Computational Linguistics, 2021 In parsing with Tree Adjoining Grammar (TAG), independent derivations have been shown by Schabes and Shieber (1994) to be essential for correctly supporting syntactic analysis, semantic interpretation, and statistical language modeling. However, the parsing algorithm they propose is not directly applicable to Feature-Based TAGs (FB-TAG).
Claire Gardent, Shashi Narayan
doaj +4 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
openaire +4 more sources
Tools and resources for Tree Adjoining Grammars [PDF]
Proceedings of the ACL 2001 Workshop on Human Language Technology and Knowledge Management -, 2001 This paper presents a workbench for Tree Adjoining Grammars that we are currently developing. This workbench includes several tools and resources based on the markup language XML, used as a convenient language to format and exchange linguistic resources.
François Barthélemy +5 more
openaire +4 more sources
The relationship between Tree Adjoining Grammars and Head Grammars [PDF]
Proceedings of the 24th annual meeting on Association for Computational Linguistics -, 1986 We examine the relationship between the two grammatical formalisms: Tree Adjoining Grammars and Head Grammars. We briefly investigate the weak equivalence of the two formalisms. We then turn to a discussion comparing the linguistic expressiveness of the two formalisms.
K. Vijay-Shanker +2 more
openaire +4 more sources
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