Listar1. Investigación por tema "Trees (mathematics)"

Mostrando ítems 1-2 de 2

    • Compressed Data Structures for Binary Relations in Practice 

      Quijada Fuentes, Carlos; Penabad, Miguel R.; Ladra, Susana; Gutiérrez Retamal, Gilberto (Institute of Electrical and Electronics Engineers, 2020-01-31)
      [Abstract] Binary relations are commonly used in Computer Science for modeling data. In addition to classical representations using matrices or lists, some compressed data structures have recently been proposed to represent ...

    • Transition-based Semantic Dependency Parsing with Pointer Networks 

      Fernández-González, Daniel; Gómez-Rodríguez, Carlos (Association for Computational Linguistics (ACL), 2020-07)
      [Abstract]: Transition-based parsers implemented with Pointer Networks have become the new state of the art in dependency parsing, excelling in producing labelled syntactic trees and outperforming graph-based models in ...