Results 1 to 10 of about 21,874 (220)
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 +6 more sources
Coordination in Tree Adjoining Grammars: Formalization and Implementation [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).
Anoop Sarkar, Aravind K. Joshi
core +6 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.
Stuart M. Shieber, Yves Schabes
openalex +3 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
openalex +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
+7 more sources
TRAINING TREE ADJOINING GRAMMARS WITH HUGE TEXT CORPUS USING SPARK MAP REDUCE [PDF]
ICTACT 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 +2 more sources
Incremental Parser Generation for Tree Adjoining Grammars [PDF]
Proceedings of the 34th annual meeting on Association for Computational Linguistics -, 1998 This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far.
Sarkar, Anoop
core +2 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.
David Weir +2 more
openalex +3 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 +3 more sources
Stochastic tree-adjoining grammars [PDF]
Proceedings of the workshop on Speech and Natural Language - HLT '91, 1992 The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is defined and basic algorithms for SLTAG are designed. 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 lexically sensitive (as N-gram models or Hidden ...
Yves Schabes
openalex +3 more sources