A Joint Deep Contextualized Word Representation for Deep Biaffine Dependency Parsing
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingSimilar Papers 제목 키워드 기반
JBNU at MRP 2019: Multi-level Biaffine Attention for Semantic Dependency Parsing
This paper describes Jeonbuk National University (JBNU){'}s system for the 2019 shared task on Cross-Framework Meaning Representation Parsing (MRP 2019) at the Conference on Computational Natural Language Learning. Of th…
DecoderDependency ParsingSemantic Dependency ParsingSentenceAuxiliary Tasks to Boost Biaffine Semantic Dependency Parsing
The biaffine parser of Dozat and Manning (2017) was successfully extended to semantic dependency parsing (SDP) (Dozat and Manning, 2018). Its performance on graphs is surprisingly high given that, without the constraint …
Dependency ParsingSemantic Dependency ParsingSentenceDependency Parsing is More Parameter-Efficient with Normalization
Dependency parsing is the task of inferring natural language structure, often approached by modeling word interactions via attention through biaffine scoring. This mechanism works like self-attention in Transformers, whe…
Dependency ParsingSentenceFew-Shot Named Entity Recognition with Biaffine Span Representation
While Named Entity Recognition (NER) is a widely studied task, making inferences of entities with only a few labeled data (i.e., few-shot NER) has been challenging. Correspondingly, the N-way K-shot NER task is proposed …
Few-shot NERNamed Entity RecognitionNamed Entity Recognition (NER)SentenceEnd-to-End Argument Mining as Biaffine Dependency Parsing
Non-neural approaches to argument mining (AM) are often pipelined and require heavy feature-engineering. In this paper, we propose a neural end-to-end approach to AM which is based on dependency parsing, in contrast to t…
Argument MiningDependency ParsingFeature EngineeringRelation+1