Buscar
Mostrando ítems 1-6 de 6
Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy
(Elsevier B.V., 2019-10)
[Absctract]: An increasingly wide range of artificial intelligence applications rely on syntactic information to process and extract meaning from natural language text or speech, with constituent trees being one of the ...
Transition-based Semantic Dependency Parsing with Pointer Networks
(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 ...
Left-to-Right Dependency Parsing with Pointer Networks
(Association for Computational Linguistics (ACL), 2019)
[Abstract]: We propose a novel transition-based algorithm that straightforwardly parses sentences from left to right by building n attachments, with n being the length of the input sentence. Similarly to the recent ...
Discontinuous grammar as a foreign language
(Elsevier, 2023-03)
[Abstract] In order to achieve deep natural language understanding, syntactic constituent parsing is a vital step, highly demanded by many artificial intelligence systems to process both text and speech. One of the most ...
Multitask Pointer Network for Multi-Representational Parsing
(Elsevier, 2022-01-25)
[Abstract] Dependency and constituent trees are widely used by many artificial intelligence applications for representing the syntactic structure of human languages. Typically, these structures are separately produced by ...
Dependency parsing with bottom-up Hierarchical Pointer Networks
(Elsevier, 2023-03)
[Abstract] Dependency parsing is a crucial step towards deep language understanding and, therefore, widely demanded by numerous Natural Language Processing applications. In particular, left-to-right and top-down transition-based ...