ListarGI-LYS - Congresos, conferencias, etc. por tema "Reentrancy Handling"
Mostrando ítems 1-1 de 1
-
A Transition-Based Algorithm for Unrestricted AMR Parsing
(Association for Computational Linguistics, 2018-06)[Absctract]: Non-projective parsing can be useful to handle cycles and reentrancy in AMR graphs. We explore this idea and introduce a greedy left-to-right non-projective transition-based parser. At each parsing configuration, ...