Buscar
Mostrando ítems 1-2 de 2
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 ...