Skip to main content
SpringerLink
Log in

Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9618))

Included in the following conference series:

Abstract

Motivated by applications in natural language processing, we study the uniform membership problem for hyperedge-replacement grammars that generate directed acyclic graphs. Our major result is a low-degree polynomial-time algorithm that solves the uniform membership problem for a restricted type of such grammars. We motivate the necessity of the restrictions by two different NP-completeness results.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Aalbersberg, I.J., Ehrenfeucht, A., Rozenberg, G.: On the membership problem for regular DNLC grammars. Discrete Appl. Math. 13, 79–85 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  2. Banarescu, L., Bonial, C., Cai, S., Georgescu, M., Griffitt, K., Hermjakob, U., Knight, K., Koehn, P., Palmer, M., Schneider, N.: Abstract meaning representation for sembanking. In: Proceedings of 7th Linguistic Annotation Workshop, ACL 2013 (2013)

    Google Scholar 

  3. Björklund, H., Drewes, F., Ericson, P.: Between a rock and a hard place - Parsing for hyperedge replacement DAG grammars. Technical report UMINF 15.13, Umeå University (2015). http://www8.cs.umu.se/research/uminf/index.cgi

  4. Chiang, D., Andreas, J., Bauer, D., Hermann, K.M., Jones, B., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: Proceedings of 51st Annual Meeting of the Association for Computational Linguistics (ACL 2013), vol. 1: Long Papers, pp. 924–932 (2013)

    Google Scholar 

  5. Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations, chap. 2, pp. 95–162. World Scientific (1997)

    Google Scholar 

  6. Drewes, F., Hoffmann, B., Minas, M.: Predictive top-down parsing for hyperedge replacement grammars. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 19–34. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  7. Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  8. Lange, K.J., Welzl, E.: String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing. Discrete Appl. Math. 16, 17–30 (1987)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We gratefully acknowledge the support from the Swedish Research Council grant 621-2011-6080 and the EU FP7 MICO project. We are furthermore grateful to the anonymous referees for various helpful comments.

Author information

Authors and Affiliations

  1. Department of Computing Science, Umeå University, Umeå, Sweden

    Henrik Björklund, Frank Drewes & Petter Ericson

Authors
  1. Henrik Björklund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Drewes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Petter Ericson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Petter Ericson .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Czech Technical University, Prague, Czech Republic

    Jan Janoušek

  3. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus Liebig University Giessen, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Björklund, H., Drewes, F., Ericson, P. (2016). Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars. In: Dediu, AH., Janoušek, J., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2016. Lecture Notes in Computer Science(), vol 9618. Springer, Cham. https://doi.org/10.1007/978-3-319-30000-9_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30000-9_40

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29999-0

  • Online ISBN: 978-3-319-30000-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation