Lexicalised Locality: Local Domains and Non-Local Dependencies in a Lexicalised Tree Adjoining Grammar [PDF]
Philosophies, 2021 Contemporary generative grammar assumes that syntactic structure is best described in terms of sets, and that locality conditions, as well as cross-linguistic variation, is determined at the level of designated functional heads.
Diego Gabriel Krivochen, Andrea Padovan
doaj +2 more sources
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 +3 more sources
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
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
Incremental parser generation for Tree Adjoining Grammars [PDF]
Proceedings of the 34th annual meeting on Association for Computational Linguistics -, 1996 12 pages, 12 Postscript figures, uses fullname ...
Anoop Sarkar
openalex +3 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
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
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).
Joshi, Aravind, Sarkar, Anoop
core +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
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