Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6270))

  • 453 Accesses

Abstract

In this book, we have shown that the generative capacity and the parsing complexity of lexicalized grammar formalisms can be systematically related to structural properties of the dependency graphs that these formalisms can induce. In this way, we have generalized Gaifman’s [1965] equivalence result from context-free generative capacity and projective dependency structures on the one hand to mildly context-sensitive generative capacity and ‘mildly’ non-projective dependency structures on the other.

In this final chapter of the book, we summarize our main contributions, and identify some avenues for future research.

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

Access this chapter

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.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kuhlmann, M. (2010). Conclusion. In: Dependency Structures and Lexicalized Grammars. Lecture Notes in Computer Science(), vol 6270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14568-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14568-1_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14567-4

  • Online ISBN: 978-3-642-14568-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics