Toward Mention Detection Robustness with Recurrent Neural Networks
Not on the map. Why?
Abstract (arXiv)
One of the key challenges in natural language processing (NLP) is to yield good performance across application domains and languages. In this work, we investigate the robustness of the mention detection systems, one of the fundamental tasks in information extraction, via recurrent neural networks (RNNs). The advantage of RNNs over the traditional approaches is their capacity to capture long ranges of context and implicitly adapt the word embeddings, trained on a large corpus, into a task-specific word representation, but still preserve the original semantic generalization to be helpful across domains. Our systematic evaluation for RNN architectures demonstrates that RNNs not only outperform the best reported systems (up to 9% relative error reduction) in the general setting but also achieve the state-of-the-art performance in the cross-domain setting for English. Regarding other languages, RNNs are significantly better than the traditional methods on the similar task of named entity recognition for Dutch (up to 22% relative error reduction).
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Feb 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 2.
4 papers.
- 2023On the Evolution of Knowledge Graphs: A Survey and Perspectivecited by 9
- 2022Kuaipedia: a Large-scale Multi-modal Short-video Encyclopediacited by 8
- 2022Trigger-GNN: A Trigger-Based Graph Neural Network for Nested Named Entity Recognitioncited by 3
- 2023Software Entity Recognition with Noise-Robust Learningcited by 1
- 2023On the Evolution of Knowledge Graphs: A Survey and Perspective7 Oct 2023
- 2023Software Entity Recognition with Noise-Robust Learning21 Aug 2023
- 2022Kuaipedia: a Large-scale Multi-modal Short-video Encyclopedia28 Oct 2022
- 2022Trigger-GNN: A Trigger-Based Graph Neural Network for Nested Named Entity Recognition12 Apr 2022