There are several knowledge bases currently published in RDF format and exploring this information is still challenging for non-RDF neither SPARQL users.
DBpedia-Search aims at facilitating information navigation, exploration, and seeking through DBpedia Knowledge base with natural language queries.
This GSoC project consists of enhancing DBpedia Search APIs by including tests, benchmarks, and additional functionalities.
Read the current papers on which SANTé is built as well as the repository:
- SANTé: A Light-Weight End-to-End Semantic Search Framework for RDF Data: SANTé: A Light-Weight End-to-End Semantic Search Framework for RDF Data | SpringerLink
- Exploring Term Networks for Semantic Search over RDF Knowledge Graphs: Exploring Term Networks for Semantic Search over RDF Knowledge Graphs | SpringerLink
Before starting the warmup tasks let’s start with a community gathering. Make a post in this project call introducing yourself, giving a brief description of your previous experiences, skills, and why you would like to work on this project.
Fork the project and start by instantiating your own instance using one of the standards data sets such as FOAF ontology or Pokemon.
Try out the implemented APIs: DBpedia Lookup, Reconcile, Search and Suggest (check the repository).
Read the APIs specifications:
- Reconciliation: Reconciliation Service API
- DBpedia lookup: GitHub - dbpedia/dbpedia-lookup: A generic entity retrieval service for linked data. Contains presets to replicate the DBpedia Lookup service.
Now that you have a good understanding of the current state of the project, we suggest you build your proposal by pondering on some of the following points, feel free to bring your own solutions to tackle the problems that the project faces.
How the current APIs can be further enhanced?
Which other APIs can be integrated?
Which benchmarks and measures can be used to evaluate the results’ accuracy?
- Project size: according to your project scope (from 175 to 300)
- Difficulty: medium
Feel free to contact us for more information. We eagerly look forward to working with you and contributing towards making data accessible to all.