Experiments with Generative Models for Dependency Tree Linearization
Code (0)
등록된 구현이 없습니다.
Tasks
Machine TranslationText GenerationSimilar Papers 제목 키워드 기반
Fast and Accurate Non-Projective Dependency Tree Linearization
We propose a graph-based method to tackle the dependency tree linearization task. We formulate the task as a Traveling Salesman Problem (TSP), and use a biaffine attention model to calculate the edge costs. We facilitate…
Traveling Salesman ProblemHead-First Linearization with Tree-Structured Representation
We present a dependency tree linearization model with two novel components: (1) a tree-structured encoder based on bidirectional Tree-LSTM that propagates information first bottom-up then top-down, which allows each toke…
DecoderBracketing Encodings for 2-Planar Dependency Parsing
We present a bracketing-based encoding that can be used to represent any 2-planar dependency tree over a sentence of length n as a sequence of n labels, hence providing almost total coverage of crossing arcs in sequence …
Dependency ParsingPOSSentenceThe expected sum of edge lengths in planar linearizations of trees. Theory and applications
Dependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges connect syntactically-dependent words. Th…
SentenceAbstractive Multi-document Summarization by Partial Tree Extraction, Recombination and Linearization
Existing work for abstractive multidocument summarization utilise existing phrase structures directly extracted from input documents to generate summary sentences. These methods can suffer from lack of consistence and co…
Abstractive Text SummarizationDocument SummarizationMulti-Document Summarization