Supporting semantic search on heterogeneous semi-structured documents

Authors:
Yassine Mrabet;Nacéra Bennacer;Nathalie Pernelle;Mouhamadou Thiam
Affiliations:
LRI, Université Paris-Sud 11, INRIA Saclay, Orsay cedex, France and SUPELEC Systems Sciences, Gif-sur-Yvette cedex, France;SUPELEC Systems Sciences, Gif-sur-Yvette cedex, France;LRI, Université Paris-Sud 11, INRIA Saclay, Orsay cedex, France;LRI, Université Paris-Sud 11, INRIA Saclay, Orsay cedex, France and SUPELEC Systems Sciences, Gif-sur-Yvette cedex, France
Venue:
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Year:
2010

Citing 7
Cited 1

KIM – a semantic platform for information extraction and retrieval

Natural Language Engineering
Searching the Semantic Web: Approximate Query Processing Based on Ontologies

IEEE Intelligent Systems
An Adaptation of the Vector-Space Model for Ontology-Based Information Retrieval

IEEE Transactions on Knowledge and Data Engineering
Incremental Ontology-Based Extraction and Alignment in Semi-structured Documents

DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Unsupervised named-entity extraction from the Web: An experimental study

Artificial Intelligence
Hybrid search: effectively combining keywords and semantic searches

ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
A relaxed approach to RDF querying

ISWC'06 Proceedings of the 5th international conference on The Semantic Web

Searching semantic data warehouses: models, issues, architectures

Proceedings of the 2nd International Workshop on Semantic Search over the Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents SHIRI-Querying, an approach for semantic search on semi-structured documents. We propose a solution to tackle incompleteness and imprecision of semantic annotations of semistructured documents at querying time. We particularly introduce three elementary reformulations that rely on the notion of aggregation and on the document structure. We present the Dynamic Reformulation and Execution of Queries algorithm (DREQ) which combines these elementary transformations to construct reformulated queries w.r.t. a defined order relation. Experiments on two real datasets show that these reformulations greatly increase the recall and that returned answers are effectively ranked according to their precision.