Buscar
Mostrando ítems 1-3 de 3
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 ...
Viable Dependency Parsing as Sequence Labeling
(Association for Computational Linguistics (ACL), 2019-06)
[Abstract]: We recast dependency parsing as a sequence labeling problem, exploring several encodings of dependency trees as labels. While dependency parsing by means of sequence labeling had been attempted in existing work, ...
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 ...