Buscar
Mostrando ítems 1-5 de 5
Sequence Tagging for Fast Dependency Parsing
(2019)
[Abstract]
Dependency parsing has been built upon the idea of using parsing methods based on shift-reduce or graph-based algorithms in order to identify binary dependency relations between the words in a sentence. In this ...
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, ...
How important is syntactic parsing accuracy? An empirical evaluation on rule-based sentiment analysis
(Springer, 2019)
[Abstract]: Syntactic parsing, the process of obtaining the internal structure of sentences in natural languages, is a crucial task for artificial intelligence applications that need to extract meaning from natural language ...
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 ...