Open AccessPosted Content
Context-Dependent Fine-Grained Entity Type Tagging
TL;DR: This work proposes the task of context-dependent fine type tagging, where the set of acceptable labels for a mention is restricted to only those deducible from the local context (e.g. sentence or document).
read more
Abstract: Entity type tagging is the task of assigning category labels to each mention of an entity in a document. While standard systems focus on a small set of types, recent work (Ling and Weld, 2012) suggests that using a large fine-grained label set can lead to dramatic improvements in downstream tasks. In the absence of labeled training data, existing fine-grained tagging systems obtain examples automatically, using resolved entities and their types extracted from a knowledge base. However, since the appropriate type often depends on context (e.g. Washington could be tagged either as city or government), this procedure can result in spurious labels, leading to poorer generalization. We propose the task of context-dependent fine type tagging, where the set of acceptable labels for a mention is restricted to only those deducible from the local context (e.g. sentence or document). We introduce new resources for this task: 12,017 mentions annotated with their context-dependent fine types, and we provide baseline experimental results on this data.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Ultra-Fine Entity Typing
Eunsol Choi,Omer Levy,Yejin Choi,Luke Zettlemoyer +3 more
- 01 Jul 2018
TL;DR: A model that can predict ultra-fine types is presented, and is trained using a multitask objective that pools the authors' new head-word supervision with prior supervision from entity linking, and achieves state of the art performance on an existing fine-grained entity typing benchmark, and sets baselines for newly-introduced datasets.
CoType: Joint Extraction of Typed Entities and Relations with Knowledge Bases
Xiang Ren,Zeqiu Wu,Wenqi He,Meng Qu,Clare R. Voss,Heng Ji,Tarek Abdelzaher,Jiawei Han +7 more
- 03 Apr 2017
TL;DR: CoType as mentioned in this paper proposes a domain-independent framework that runs a data-driven text segmentation algorithm to extract entity mentions and jointly embeds entity mentions, relation mentions, text features and type labels into two low-dimensional spaces, where objects whose types are close will also have similar representations.
288
•Posted Content
CoType: Joint Extraction of Typed Entities and Relations with Knowledge Bases
TL;DR: A novel domain-independent framework that jointly embeds entity mentions, relation mentions, text features and type labels into two low-dimensional spaces, and adopts a novel partial-label loss function for noisy labeled data and introduces an object "translation" function to capture the cross-constraints of entities and relations on each other.
257
Training Complex Models with Multi-Task Weak Supervision.
Alexander Ratner,Braden Hancock,Jared Dunnmon,Frederic Sala,Shreyash Pandey,Christopher Ré +5 more
- 17 Jul 2019
TL;DR: This work shows that by solving a matrix completion-style problem, it can recover the accuracies of these multi-task sources given their dependency structure, but without any labeled data, leading to higher-quality supervision for training an end model.
Parsing
W. A. Martin
- 01 Jun 1980
TL;DR: There has been a shift of emphasis away from highly ~tmctured systems of complex rules as the principal repository of infi~mmtion about the syntax of a language towards a view in which the responsibility is distributed among the Icxicoo.
155
References
Introduction to the CoNLL-2003 shared task: language-independent named entity recognition
Erik Tjong Kim Sang,Fien De Meulder +1 more
- 31 May 2003
TL;DR: The CoNLL-2003 shared task on NER as mentioned in this paper was the first NER task with language-independent named entity recognition (NER) data sets and evaluation method, and a general overview of the systems that participated in the task and their performance.
A maximum entropy approach to natural language processing
TL;DR: A maximum-likelihood approach for automatically constructing maximum entropy models is presented and how to implement this approach efficiently is described, using as examples several problems in natural language processing.
Accurate Unlexicalized Parsing
Dan Klein,Christopher D. Manning +1 more
- 07 Jul 2003
TL;DR: It is demonstrated that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down false independence assumptions latent in a vanilla treebank grammar.
•Proceedings Article
Named Entity Recognition in Tweets: An Experimental Study
Alan Ritter,Sam Clark,Oren Etzioni +2 more
- 27 Jul 2011
TL;DR: The novel T-ner system doubles F1 score compared with the Stanford NER system, and leverages the redundancy inherent in tweets to achieve this performance, using LabeledLDA to exploit Freebase dictionaries as a source of distant supervision.
•Proceedings Article
The Automatic Content Extraction (ACE) Program Tasks, Data, and Evaluation
George R. Doddington,Alexis Mitchell,Mark A. Przybocki,Lance Ramshaw,Stephanie Strassel,Ralph Weischedel +5 more
- 01 May 2004
TL;DR: The objective of the ACE program is to develop technology to automatically infer from human language data the entities being mentioned, the relations among these entities that are directly expressed, and the events in which these entities participate.
Related Papers (5)
Jeffrey Pennington,Richard Socher,Christopher D. Manning +2 more
- 01 Oct 2014
Eunsol Choi,Omer Levy,Yejin Choi,Luke Zettlemoyer +3 more
- 01 Jul 2018