This paper describes the USTC NELSLIP systems submitted to the Trilingual Entity Detection and Linking (EDL) track in 2016 TAC Knowledge Base Population (KBP) contests. We have built two systems for entity discovery and mention detection (MD): one uses the conditional RNNLM and the other one uses the attention-based encoder-decoder framework. The entity linking (EL) system consists of two modul...

osz et al., 1995) tries to explain relations among attention, anaphora, and theoretical limitations. The first is the lack of a principle behind these a. The second is that the salience of discourse entities has not been d, although it plays a critical role in this theory. Hasida et al. (1995, 1996) game as a more principled model of intentional communication based on im that it can derive cent...

Information retrieval (IR) is finding material (usually documents) of an unstructured nature (usually text) that satisfies an information need from within large collections (usually stored on computers) [1]. The most common and popular information retrieval application is web search engine such as Google[2], Baidu[3], Bing[4] and Sogou[5]. These application will return top-N best retrieval resu...

In this paper, we document our efforts in participating to the TREC 2009 Entity Ranking and Web Tracks. We had multiple aims: For the Web Track’s Adhoc task we experiment with document text and anchor text representation, and the use of the link structure. For the Web Track’s Diversity task we experiment with using a top down sliding window that, given the top ranked documents, chooses as the n...

User query q, Web pages {v } (q, v) can be represented with a rich feature vector Text match score with title, anchor text, headings, bold text, body text,. .. , of v as a hypertext document Pagerank, topic-specific Pageranks, personalized Pageranks of v as a node in the Web graph Estimated location of user, commercial intent,. .. Must we guess the relative importance of these features? How to ...

In this paper, we document our efforts in participating to the TREC 2010 Entity Ranking and Web Tracks. We had multiple aims: For the Web Track we wanted to compare the effectiveness of anchor text of the category A and B collections and the impact of global document quality measures such as PageRank and spam scores. For the Entity Ranking Track, we use Wikipedia as a pivot to find relevant ent...

Entity linking requires ranking thousands of candidates for each query, a time consuming process and a challenge for large scale linking. Many systems rely on prediction cascades to efficiently rank candidates. However, the design of these cascades often requires manual decisions about pruning and feature use, limiting the effectiveness of cascades. We present Slinky, a modular, flexible, fast ...

Traditional learning-based coreference resolvers operate by training a mentionpair classifier for determining whether two mentions are coreferent or not. Two independent lines of recent research have attempted to improve these mention-pair classifiers, one by learning a mentionranking model to rank preceding mentions for a given anaphor, and the other by training an entity-mention classifier to...

Connections between relations in relation extraction, which we call class ties, are common. In distantly supervised scenario, one entity tuple may have multiple relation facts. Exploiting class ties between relations of one entity tuple will be promising for distantly supervised relation extraction. However, previous models are not effective or ignore to model this property. In this work, to ef...

Knowledge bases play a crucial role in modern search engines and provide users with information about entities. A knowledge base may contain many facts (i.e., RDF triples) about an entity, but only a handful of them are of significance for a searcher. Identifying and ranking these RDF triples is essential for various applications of search engines, such as entity ranking and summarization. In t...