Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs
Open Access
- 1 January 2019
- conference paper
- Published by Association for Computational Linguistics (ACL)
- p. 7-17
Abstract
Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta. Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing. 2019.Keywords
This publication has 10 references indexed in Scilit:
- A Transition-Based Algorithm for Unrestricted AMR Parsing2018
- AMR Parsing using Stack-LSTMs2017
- Towards a Catalogue of Linguistic Graph BanksComputational Linguistics, 2016
- Parsing to Noncrossing Dependency GraphsTransactions of the Association for Computational Linguistics, 2015
- A Synchronous Hyperedge Replacement Grammar based approach for AMR parsing2015
- SemEval 2015 Task 18: Broad-Coverage Semantic Dependency Parsing2015
- SemEval 2014 Task 8: Broad-Coverage Semantic Dependency Parsing2014
- The Power of Extended Top-Down Tree TransducersSIAM Journal on Computing, 2009
- The Equivalence of Bottom-Up and Top-Down Tree-to-Graph TransducersJournal of Computer and System Sciences, 1998
- The translation power of top-down tree-to-graph transducersJournal of Computer and System Sciences, 1994