Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

Weighted DAG Automata for Semantic Graphs

Computational Linguistics (2018) 44 (1): 119–186.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
Transduction from trees to graphs through folding
  • Martin Berglund
  • Henrik Björklund
  • Johanna Björklund
  • Adrien Boiret
Information and Computation (2023) 295: 105111.
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
  • Johanna Björklund
  • Shay B. Cohen
  • Frank Drewes
  • Giorgio Satta
Theoretical Computer Science (2021) 870: 3.
Uniform parsing for hyperedge replacement grammars
  • Henrik Björklund
  • Frank Drewes
  • Petter Ericson
  • Florian Starke
Journal of Computer and System Sciences (2021) 118: 1.

Advertisement

  • Online ISSN 1530-9312
  • Print ISSN 0891-2017
A product of The MIT Press
Newsletter Sign Up

MIT Press Direct

Information

MIT Press

Contact Us

© 2023 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept