Neural Architectures for Named Entity Recognition
arXiv:1603.01360
Abstract
State-of-the-art named entity recognition systems rely heavily on hand-crafted features and domain-specific knowledge in order to learn effectively from the small, supervised training corpora that are available. In this paper, we introduce two new neural architectures---one based on bidirectional LSTMs and conditional random fields, and the other that constructs and labels segments using a transition-based approach inspired by shift-reduce parsers. Our models rely on two sources of information about words: character-based word representations learned from the supervised corpus and unsupervised word representations learned from unannotated corpora. Our models obtain state-of-the-art performance in NER in four languages without resorting to any language-specific knowledge or resources such as gazetteers.
Proceedings of NAACL 2016
References in corpus (9)
- Adam: A Method for Stochastic Optimization
- Efficient Estimation of Word Representations in Vector Space
- Improving neural networks by preventing co-adaptation of feature detectors
- ADADELTA: An Adaptive Learning Rate Method
- Natural Language Processing (almost) from Scratch
- Transition-Based Dependency Parsing with Stack Long Short-Term Memory
- Finding Function in Form: Compositional Character Models for Open Vocabulary Word Representation
- Multilingual Language Processing From Bytes
- Training with Exploration Improves a Greedy Stack-LSTM Parser