Skip to main content

Dependency Structure Grammars

  • Conference paper
Logical Aspects of Computational Linguistics (LACL 2005)

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

Abstract

In this paper, we define Dependency Structure Grammars (DSG), which are rewriting rule grammars generating sentences together with their dependency structures, are more expressive than CF-grammars and non-equivalent to mildly context-sensitive grammars.

We show that DSG are weakly equivalent to Categorial Dependency Grammars (CDG) recently introduced in [6,3]. In particular, these dependency grammars naturally express long distance dependencies and enjoy good mathematical properties.

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.

References

  1. Les grammaires de dépendance. In: S. Kahane, editor, Traitement automatique des langues, volume 41, Paris, Hermes (2000)

    Google Scholar 

  2. Kruijff, G.-J.M., Duchier, D. (eds.): Proc. of the workshop “Recent Advances in Dependency Grammars, COLING 2004 Workshop, Geneva, Switzerland, August 28 (2004)

    Google Scholar 

  3. Dekhtyar, M., Dikovsky, A.: Categorial dependency grammars. In: Proc. of Int. Conf. on Categorial Grammars, Montpellier, France, pp. 76–91 (2004)

    Google Scholar 

  4. Dikovsky, A.: Grammars for local and long dependencies. In: Proc. of the 39th Intern. Conf. ACL 2001, pp. 156–163. ACL and Morgan Kaufman, San Francisco (2001)

    Google Scholar 

  5. Dikovsky, A.: Polarized non-projective dependency grammars. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 139–157. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Dikovsky, A.: Dependencies as categories. In: Kruijff, G.-J.M., Duchier, D. (eds.) Proc. of Workshop Recent Advances in Dependency Grammars. In conjunction with COLING 2004, Geneva, Switzerland, August, 28th, pp. 90–97.

    Google Scholar 

  7. Dikovsky, A., Modina, L.: Dependencies on the other side of the Curtain. Traitement Automatique des Langues (TAL) 41(1), 79–111 (2000)

    Google Scholar 

  8. Duchier, D., Debusmann, R.: Topological dependency trees: A constraint based account of linear precedence. In: Proc. of the 39th Intern. Conf. ACL 2001, pp. 180–187. ACL & Morgan Kaufman, San Francisco (2001)

    Google Scholar 

  9. Joshi, A.K., Shanker, V.K., Weir, D.J.: The convergence of mildly context-sensitive grammar formalisms. In: Sells, P., Shieber, S., Wasow, T. (eds.) Foundational issues in natural language processing, Cambridge, MA, pp. 31–81. MIT Press, Cambridge (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Béchet, D., Dikovsky, A., Foret, A. (2005). Dependency Structure Grammars. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_2

Download citation

  • DOI: https://doi.org/10.1007/11422532_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25783-7

  • Online ISBN: 978-3-540-31953-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics