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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). 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)