Abstract
The aim of this paper is to describe an approach to semantic representation in the Lexicalized Tree Adjoining Grammars (LTAG)[1] paradigm. We show how to use all the informations contained in the two representation structures provided by the LTAG formalism in order to provide a dependency graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Joshi, A.K.: Introduction to tree adjoining grammar. In: Manaster-Ramer, A. (ed.) The Mathematics of Language, J. Benjamins (1987)
Abeillé, A.: Une grammaire lexicalisée d’arbres adjoints pour le français. PhD thesis, Paris 7 (1991)
Candito, M.H., Kahane, S.: Can the tag derivation tree represent a semantic graph ? In: Proceedings TAG+4, Philadelphie, pp. 21–24 (1998)
Schabes, Y., Shieber, S.: An alternative conception of tree-adjoining derivation. Computational Linguistics 20, 91–124 (1994)
Rambow, O., Joshi, A.K.: A Formal Look at Dependency Grammar and Phrase Structure Grammars, with Special consideration of Word Order Phenomena, Leo Wanner, Pinter London, vol. 94 (1994)
Gardent, C., Kallmeyer, L.: Semantic construction in feature-based tag. In: Procedings of EACL (2003)
Franck, A., van Genabith, J.: Gluetag: Linear logic based semantics for ltag -and what it teaches us about lfg and ltag-. In: Proceddings of the LFG 2001 Conference, University of Hong Kong, Hong Kong (2001)
Weir, D.: Characterizing Midly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania (1988)
Kallmeyer, L., Joshi, A.: Factoring predicate argument and scope semantics: Underspecified semantics with ltag. In: Proceedings of the 12th Amsterdam Colloquium (December 1999)
Kallmeyer, L.: LTAG Semantics with Semantic Unification. In: Proceedings of TAG+7 (2004) (To appears)
Abeilleé, A.: Verbes ”à monté” et auxiliaires dans une grammaire d’arbres adjoints. In: LINX,Linguistique Institut Nanterre Paris X (1999)
Vijay-Shanker, K., Weir, D.: The use of shared forests in tree adjoining grammar parsing. In: EACL 1993, pp. 384–393 (1993)
Aho, A.V.: Indexed grammars-an extension of context-free grammars. J. ACM 15, 647–671 (1968)
Seddah, D.: Synchronisation des connaissances syntaxiques et sémantiques pour l’analyse d’énoncés en langage naturel à l’aide des grammaires d’arbres adjoints lexicalisées. PhD thesis, Université Henry Poincaré, Nancy (2004)
Billot, S., Lang, B.: The structure of shared forests in ambigous parsing. In: 33rd Conference of the Association for Computional Linguistics, ACL 1989 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seddah, D., Gaiffe, B. (2005). How to Build Argumental Graphs Using TAG Shared Forest: A View from Control Verbs Problematic. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_19
Download citation
DOI: https://doi.org/10.1007/11422532_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25783-7
Online ISBN: 978-3-540-31953-5
eBook Packages: Computer ScienceComputer Science (R0)