Skip to main content
SpringerLink
Log in

Tree-to-Graph Transductions with Scope

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2018)

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

Included in the following conference series:

Abstract

High-level natural language processing requires formal languages to represent semantic information. A recent addition of this kind is abstract meaning representations. These are graphs in which nodes encode concepts and edges relations. Node-sharing is common, and cycles occur. We show that the required structures can be generated through the combination of (i) a regular tree grammar, (ii) a sequence of linear top-down tree transducers, and (iii) a fold operator that merges selected nodes. Delimiting the application of the fold operator to connected subgraphs gains expressive power, while keeping the complexity of the associated membership problem in polynomial time.

Supported by the Swedish Research Council, Grant No. 621-2012-4555.

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

Notes

  1. 1.

    https://www8.cs.umu.se/research/uminf/index.cgi?year=2018&number=7.

References

  1. Banarescu, L., et al.: Abstract meaning representation for sembanking. In: Proceedings of the 7th Linguistic Annotation Workshop and Interoperability with Discourse, pp. 178–186. ACL, Sofia (2013)

    Google Scholar 

  2. Banarescu, L., et al.: Abstract meaning representation (AMR) 1.2 specification. Technical report, Information Science Institute, University of Southern California, CA, USA (2014)

    Google Scholar 

  3. Koller, A.: Semantic construction with graph grammars. In: Proceedings of the 14th International Conference on Computational Semantics (IWCS), London (2015)

    Google Scholar 

  4. Quernheim, D., Knight, K.: DAGGER: a toolkit for automata on directed acyclic graphs. In: Proceedings of the 10th International Workshop Finite-State Methods and Natural Language Processing, pp. 40–44. ACL (2012)

    Google Scholar 

  5. Brainerd, W.S.: The minimalization of tree automata. Inf. Control 13(5), 484–491 (1968)

    Article  MathSciNet  Google Scholar 

  6. Rounds, W.C.: Trees, Transducers, and Transformations. Ph.D. dissertation (1968)

    Google Scholar 

  7. Drewes, F., Kreowski, H.-J., Habel, A.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, pp. 95–162. World Scientific Publishing Co., Inc., River Edge (1997)

    Chapter  Google Scholar 

  8. Chiang, D., Andreas, J., Bauer, D., Hermann, K.M., Jones, B., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: Proceedings of the 51st Meeting of the ACL (2013)

    Google Scholar 

  9. Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a \(k\)-tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987)

    Article  MathSciNet  Google Scholar 

  10. Groschwitz, J., Koller, A., Teichmann, C.: Graph parsing with s-graph grammars. In: Proceedings of the 53rd Annual Meeting of the ACL and the 7th International Joint Conference on NLP, vol. 1, pp. 1481–1490 (2015)

    Google Scholar 

  11. Lautemann, C.: Tree automata, tree decomposition and hyperedge replacement. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 520–537. Springer, Heidelberg (1991). https://doi.org/10.1007/BFb0017410

    Chapter  MATH  Google Scholar 

  12. Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theor. Comput. Sci. 126(1), 53–75 (1994)

    Article  Google Scholar 

  13. Engelfriet, J., Vogler, H.: The equivalence of bottom-up and top-down tree-to-graph transducers. J. Comput. Syst. Sci. 56(3), 332–356 (1998)

    Article  MathSciNet  Google Scholar 

  14. Chiang, D., Drewes, F., Gildea, D., Satta, G., Lopez, A.: Weighted DAG automata for semantic graphs. Unpublished (2017)

    Google Scholar 

  15. Baker, B.S.: Tree transducers and tree languages. Inf. Control 37(3), 241–266 (1978)

    Article  MathSciNet  Google Scholar 

  16. Engelfriet, J.: Tree automata and tree grammars. Lecture Notes on Formal Languages and Automata Theory (1975). http://arxiv.org/abs/1510.02036

Download references

Acknowledgments

I am immensely thankful to the reviewers for their insightful comments and helpful references which greatly improved this work.

Author information

Authors and Affiliations

  1. Umeå University, Umeå, Sweden

    Johanna Björklund

Authors
  1. Johanna Björklund
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Johanna Björklund .

Editor information

Editors and Affiliations

  1. National Archives of Japan, Tokyo, Japan

    Mizuho Hoshi

  2. The University of Electro-Communications, Tokyo, Japan

    Shinnosuke Seki

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Björklund, J. (2018). Tree-to-Graph Transductions with Scope. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98654-8_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98653-1

  • Online ISBN: 978-3-319-98654-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation