论文信息 - A case for semantic full-text search

A case for semantic full-text search

We discuss the advantages and shortcomings of full-text search on the one hand and search in ontologies/triple stores on the other hand. We argue that both techniques have an important quality missing from the other. We advocate a deep integration of the two, and describe the associated requirements and challenges.

[1] Tim Berners-Lee,et al. Linked Data - The Story So Far , 2009, Int. J. Semantic Web Inf. Syst..

[2] Tim Berners-Lee,et al. Linked data on the web (LDOW2008) , 2008, WWW.

[3] Charu C. Aggarwal,et al. Mining Text Data , 2012 .

[4] E. Prud hommeaux,et al. SPARQL query language for RDF , 2011 .

[5] Maria T. Pazienza,et al. Information Extraction , 2002, Lecture Notes in Computer Science.

[6] Peter Mika,et al. Ad-hoc object retrieval in the web of data , 2010, WWW '10.

[7] Hannah Bast,et al. Broccoli: Semantic Full-Text Search at your Fingertips , 2012, ArXiv.

[8] Oren Etzioni,et al. The Tradeoffs Between Open and Traditional Relation Extraction , 2008, ACL.

[9] Erik F. Tjong Kim Sang,et al. Introduction to the CoNLL-2003 Shared Task: Language-Independent Named Entity Recognition , 2003, CoNLL.

[10] Jimmy J. Lin,et al. Web question answering: is more always better? , 2002, SIGIR '02.

[11] Charu C. Aggarwal,et al. Mining Text Data , 2012, Springer US.

[12] Roi Blanco,et al. Finding support sentences for entities , 2010, SIGIR.

[13] Fang Kong,et al. Exploiting Constituent Dependencies for Tree Kernel-Based Semantic Relation Extraction , 2008, COLING.

[14] Tim Berners-Lee,et al. Linked Data on the Web , 2008, LDOW.