Ориентированные ациклические графы

otherentity ID: directedacyclicgraphs

Related Papers

The complexity of finding the maximum spanning DAG and other restrictions for DAG parsing of natural language

Authors: nan

Publication: TIPSTER (2015)

DOI: nan

Recently, there has been renewed interest in semantic dependency parsing, among which one of the paradigms focuses on parsing di- rected acyclic graphs (DAGs). Considera- tion of the decoding problem …...

26127

DAG-Structured Long Short-Term Memory for Semantic Compositionality

Authors: nan

Publication: TIPSTER (2016)

DOI: nan

Recurrent neural networks, particularly long short-term memory (LSTM), have recently shown to be very effective in a wide range of sequence modeling problems, core to which is effective learning of …...

23162

Transition-based Semantic Dependency Parsing with Pointer Networks

Authors: nan

Publication: TIPSTER (2020)

DOI: nan

AbstractTransition-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 this task. …...

37345