iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: http://link.springer.com/chapter/10.1007/3-540-36456-0_1
Starting with Complex Primitives Pays Off | SpringerLink
Skip to main content

Starting with Complex Primitives Pays Off

  • Conference paper
  • First Online:
Computational Linguistics and Intelligent Text Processing (CICLing 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2588))

  • 899 Accesses

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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

    Google Scholar 

  2. Joshi, A. K., Schabes, Y.: Tree-Adjoining Grammars. G. Rosenberg and A. Salomaa, editors, Handbook of Formal Languages, Springer, Berlin (1997) 69–123

    Google Scholar 

  3. 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

    Google Scholar 

  4. 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

    Google Scholar 

  5. 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

    Google Scholar 

  6. Webber, B., Joshi, A. K., Knott, A., Stone, M.: Anaphora and Discourse Structure. To appear in Computational Linguistics (2003)

    Google Scholar 

  7. Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. Dissertation, University of Pennsylvania, Philadelphia (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics