Abstract
In this book, we develop the formal theory of dependency structures, show how combining these structures with a regular means of composition yields infinite hierarchies of ever more powerful dependency languages, and classify several grammar formalisms with respect to the languages in these hierarchies that they are able to characterize. Our results show 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kuhlmann, M. (2010). Introduction. 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-14568-1_1
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)