Ranking very many typed entities on wikipedia
- 6 November 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1015-1018
- https://doi.org/10.1145/1321440.1321599
Abstract
We discuss the problem of ranking very many entities of different types. In particular we deal with a heterogeneous set of types, some being very generic and some very specific. We discuss two approaches for this problem: i) exploiting the entity containment graph and ii) using a Web search engine to compute entity relevance. We evaluate these approaches on the real task of ranking Wikipedia entities typed with a state-of-the-art named-entity tagger. Results show that both approaches can greatly increase the performance of methods based only on passage retrievalKeywords
This publication has 3 references indexed in Scilit:
- The Wikipedia XML corpusACM SIGIR Forum, 2006
- Optimizing scoring functions and indexes for proximity search in type-annotated corporaPublished by Association for Computing Machinery (ACM) ,2006
- Flink: Semantic Web technology for the extraction and analysis of social networksJournal of Web Semantics, 2005