paper-with-me

Papers

Universal Dependencies according to BERT: both more specific and more general

2020-04-30 · Findings of the Association for Computational Linguistics 2020 · Tomasz Limisiewicz, Rudolf Rosa, David Mareček

This work focuses on analyzing the form and extent of syntactic abstraction captured by BERT by extracting labeled dependency trees from self-attentions. Previous work showed that individual BERT heads tend to encode particular dependency relation types. We extend these findings by explicitly comparing BERT relations to Universal Dependencies (UD) annotations, showing that they often do not match one-to-one. We suggest a method for relation identification and syntactic tree construction. Our approach produces significantly more consistent dependency trees than previous work, showing that it better explains the syntactic abstractions in BERT. At the same time, it can be successfully applied with only a minimal amount of supervision and generalizes well across languages.

📄 PDF Abstract BibTeX arXiv:2004.14620

Code (2)

Tom556/BERTHeadEnsembles 공식 구현
tomlimi/bertheadensembles

Tasks

Relation

Methods 이 논문이 사용한 방법론

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Residual Connection 설명 없음
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
Weight Decay 설명 없음
Refunds@Expedia|||How do I get a full refund from Expedia? “How do I get a full refund from Expedia? How do I get a full refund from Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Quick Help &…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Adam 설명 없음

Similar Papers 제목 키워드 기반

Køpsala: Transition-Based Graph Parsing via Efficient Training and Effective Encoding

2020-05-25 · Daniel Hershcovich, Miryam de Lhoneux, Artur Kulmizev, Elham Pejhan 외

We present K{\o}psala, the Copenhagen-Uppsala system for the Enhanced Universal Dependencies Shared Task at IWPT 2020. Our system is a pipeline consisting of off-the-shelf models for everything but enhanced graph parsing…

Sentence

K\opsala: Transition-Based Graph Parsing via Efficient Training and Effective Encoding

2020-07-01 · WS 2020 7 · Daniel Hershcovich, Miryam de Lhoneux, Artur Kulmizev, Elham Pejhan 외

We present K{\o}psala, the Copenhagen-Uppsala system for the Enhanced Universal Dependencies Shared Task at IWPT 2020. Our system is a pipeline consisting of off-the-shelf models for everything but enhanced graph parsing…

Sentence

PortiLexicon-UD: a Portuguese Lexical Resource according to Universal Dependencies Model

2022-06-01 · LREC 2022 6 · Lucelene Lopes, Magali Duran, Paulo Fernandes, Thiago Pardo

This paper presents PortiLexicon-UD, a large and freely available lexicon for Portuguese delivering morphosyntactic information according to the Universal Dependencies model. This lexical resource includes part of speech…

LEMMAPOSTAG

Universal dependencies for Uyghur

2016-12-01 · WS 2016 12 · Marhaba Eli, Weinila Mushajiang, Tuergen Yibulayin, Kahaerjiang Abiderexiti 외

The Universal Dependencies (UD) Project seeks to build a cross-lingual studies of treebanks, linguistic structures and parsing. Its goal is to create a set of multilingual harmonized treebanks that are designed according…

Cross-Lingual Transfer

75 Languages, 1 Model: Parsing Universal Dependencies Universally

2019-04-03 · IJCNLP 2019 11 · Dan Kondratyuk, Milan Straka

We present UDify, a multilingual multi-task model capable of accurately predicting universal part-of-speech, morphological features, lemmas, and dependency trees simultaneously for all 124 Universal Dependencies treebank…

Dependency ParsingmodelZero-Shot Learning