Bipartite Flat-Graph Network for Nested Named Entity Recognition
Authors:
- Ying LuoYLYing Luo
- Hai ZhaoHZHai Zhao
Preprint
Abstract
In this paper, we propose a novel bipartite flat-graph network (BiFlaG) for nested named entity recognition (NER), which contains two subgraph modules: a flat NER module for outermost entities and a graph module for all the entities located in inner layers. Bidirectional LSTM (BiLSTM) and graph convolutional network (GCN) are adopted to jointly learn flat entities and their inner dependencies. Different from previous models, which only consider the unidirectional delivery of information from innermost layers to outer ones (or outside-to-inside), our model effectively captures the bidirectional interaction between them. We first use the entities recognized by the flat NER module to construct an entity graph, which is fed to the next graph module. The richer representation learned from graph module carries the dependencies of inner entities and can be exploited to improve outermost entity predictions. Experimental results on three standard nested NER datasets demonstrate that our BiFlaG outperforms previous state-of-the-art models.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- A Boundary-aware Neural Model for Nested Named Entity Recognition2019
- Deep Exhaustive Model for Nested Named Entity Recognition2018
- Neural Segmental Hypergraphs for Overlapping Mention Recognition2018
- Learning Better Internal Structure of Words for Sequence Labeling2018
- A Unified Syntax-aware Framework for Semantic Role Labeling2018
- Chinese Pinyin Aided IME, Input What You Have Not Keystroked Yet2018
- Labeling Gaps Between Words: Recognizing Overlapping Mentions with Mention Separators2017
- Encoding Sentences with Graph Convolutional Networks for Semantic Role Labeling2017
- Joint Mention Extraction and Classification with Mention Hypergraphs2015
- GENIA corpus—a semantically annotated corpus for bio-textminingBioinformatics, 2003