Complex correspondences for query patterns rewriting

Abstract : This paper discusses the use of complex alignments in the task of automatic query patterns rewriting. We apply this approach in SWIP, a system that allows for querying RDF data from natural language-based queries, hiding the complexity of SPARQL. SWIP is based on the use of query patterns that characterise families of queries and that are instantiated with respect to the initial user query expressed in natural language. However, these patterns are specific to the vocabulary used to describe the data source to be queried. For rewriting query patterns, we experiment ontology matching approaches in order to find complex correspondences between two ontologies describing data sources. From the alignments and initial query patterns, we rewrite these patterns in order to be able to query the data described using the target ontology. These experiments have been carried out on an ontology on the music domain and DBpedia ontology.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01152651
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Tuesday, May 19, 2015 - 10:57:05 AM
Last modification on : Thursday, June 27, 2019 - 4:27:49 PM
Long-term archiving on : Thursday, April 20, 2017 - 1:43:36 AM

File

Gillet_12894.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01152651, version 1
  • OATAO : 12894

Collections

Citation

Pascal Gillet, Cassia Trojahn, Ollivier Haemmerlé, Camille Pradel. Complex correspondences for query patterns rewriting. The 12th International Semantic Web Conference - ISWC 2013 (Ontology Matching), Oct 2013, Sydney, Australia. pp. 49-60. ⟨hal-01152651⟩

Share

Metrics

Record views

103

Files downloads

92