Abstract
For the specification of formal systems for a grammar formalism, conventional mathematical wisdom dictates that we start with primitives (basic primitive structures or building blocks) as simple as possible and then introduce various operations for constructing more complex structures. Alternatively, we can start with complex (more complicated) primitives that directly capture crucial linguistic properties and then introduce some general operations (language independent operations) for composing them. This latter approach has led to the so-called strongly lexicalized grammars, providing some new insights into syntactic description, semantic composition, discourse structure, language generation, psycholinguistic and statistical processing, all with computational implications. In this paper, we will illustrate some of these insights in the context of the lexicalized tree-adjoining grammar (LTAG).
This work was partially supported by NSF grant NSF-STC SBR 8920230
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Joshi, A. K., Becker, T., Rambow, O.: Complexity of Scrambling: A New Twist to the Competence-Performance Distinction. A. Abeille and O. Rambow (editors), Tree-Adjoining Grammar, CSLI, Stanford (2000) 167–182
Joshi, A. K., Schabes, Y.: Tree-Adjoining Grammars. G. Rosenberg and A. Salomaa, editors, Handbook of Formal Languages, Springer, Berlin (1997) 69–123
Joshi, A. K., Vijay-Shanker, K.: Compositional Semantics with Lexicalized Treeadjoining Grammar (LTAG): How Much Underspecification is Necessary? H.C. Bunt and E.G.C. Thijsse, editors, Proceedings of the Third International Workshop on Computational Semantics (IWCS-3), Tilburg. (1999) 131–145
Kallmeyer, L., Joshi, A. K.: Factoring Predicate Argument and Scope Semantics: Underspecified Semantics with LTAG. Proc. of the Twelfth Amsterdam Colloquium, University of Amsterdam, Amsterdam (1999) 169–174
Webber, B., Joshi, A. K., Knott, A., Stone, M.: What are Little Texts Made of? A Structural and Presuppositional Account Using Lexicalized TAG. Proceedings of the International Workshop on Levels of Representation in Discourse (LORID’ 99), Edinburgh (1999) 151–156
Webber, B., Joshi, A. K., Knott, A., Stone, M.: Anaphora and Discourse Structure. To appear in Computational Linguistics (2003)
Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. Dissertation, University of Pennsylvania, Philadelphia (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joshi, A.K. (2003). Starting with Complex Primitives Pays Off. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2003. Lecture Notes in Computer Science, vol 2588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36456-0_1
Download citation
DOI: https://doi.org/10.1007/3-540-36456-0_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00532-2
Online ISBN: 978-3-540-36456-6
eBook Packages: Springer Book Archive