-
Sébastien Ferré.
Reconciling Expressivity and Usability in Information Access - From Filesystems to the Semantic Web.
Habilitation thesis,
Matisse, Univ. Rennes 1,
2014.
Note: Habilitation à Diriger des Recherches (HDR), defended on November 6th.
Keyword(s): expressivity,
usability,
information access,
information retrieval,
query language,
navigation structure,
interactive view,
abstract conceptual navigation,
file system,
semantic web.
Abstract: |
In many domains where information access plays a central role, there is a gap between expert users who can ask complex questions through formal query languages (e.g., SQL), and lay users who either are dependent on expert users, or must restrict themselves to ask simpler questions (e.g., keyword search). Because of the formal nature of those languages, there seems to be an unescapable trade-off between expressivity and usability in information systems. The objective of this thesis is to present a number of results and perspectives that show that the expressivity of formal languages can be reconciled with the usability of widespread information systems (e.g., browsing, Faceted Search (FS)). The final aim of this work is to empower people with the capability to produce, explore, and analyze their data in a powerful way.
\paragraph{} We have proposed a number of theories and implementations to better reconcile expressivity and usability, and applied them to a number of contexts going from file systems to the Semantic Web. In this thesis, we introduce an unifying framework inspired by Formal Concept Analysis (FCA) to factor out the main ideas of all those results: Abstract Conceptual Navigation (ACN). The principle of ACN is to guide users by letting them {\em navigate} in a conceptual space where places are {\em concepts} connected by navigation links. Concepts are characterized by a formal query, and are made of two parts: an {\em extension} and an {\em intension}. The extension is made of query results while the intension is made of the query itself and an index of query increments over results. Finally, navigation links are formally defined as query transformations. The conceptual space is not static but is induced by concrete data, and evolves with it. ACN therefore combines the {\em expressivity} of formal query languages with the {\em guidance} of conceptual navigation. The {\em readability} of queries is improved by verbalizing them to (or parsing them from) a Controlled Natural Language (CNL). Readability and guidance together support usability by speaking user's language, and by providing a systematic assistance. |
@PhdThesis{Fer2014hdr,
type = {Habilitation thesis},
author = {Sébastien Ferré},
title = {Reconciling Expressivity and Usability in Information Access - From Filesystems to the Semantic Web},
school = {Matisse, Univ. Rennes 1},
year = {2014},
note = {Habilitation à Diriger des Recherches (HDR), defended on November 6th},
keywords = {expressivity, usability, information access, information retrieval, query language, navigation structure, interactive view, abstract conceptual navigation, file system, semantic web},
abstract = {In many domains where information access plays a central role, there is a gap between expert users who can ask complex questions through formal query languages (e.g., SQL), and lay users who either are dependent on expert users, or must restrict themselves to ask simpler questions (e.g., keyword search). Because of the formal nature of those languages, there seems to be an unescapable trade-off between expressivity and usability in information systems. The objective of this thesis is to present a number of results and perspectives that show that the expressivity of formal languages can be reconciled with the usability of widespread information systems (e.g., browsing, Faceted Search (FS)). The final aim of this work is to empower people with the capability to produce, explore, and analyze their data in a powerful way.
\paragraph{} We have proposed a number of theories and implementations to better reconcile expressivity and usability, and applied them to a number of contexts going from file systems to the Semantic Web. In this thesis, we introduce an unifying framework inspired by Formal Concept Analysis (FCA) to factor out the main ideas of all those results: Abstract Conceptual Navigation (ACN). The principle of ACN is to guide users by letting them {\em navigate} in a conceptual space where places are {\em concepts} connected by navigation links. Concepts are characterized by a formal query, and are made of two parts: an {\em extension} and an {\em intension}. The extension is made of query results while the intension is made of the query itself and an index of query increments over results. Finally, navigation links are formally defined as query transformations. The conceptual space is not static but is induced by concrete data, and evolves with it. ACN therefore combines the {\em expressivity} of formal query languages with the {\em guidance} of conceptual navigation. The {\em readability} of queries is improved by verbalizing them to (or parsing them from) a Controlled Natural Language (CNL). Readability and guidance together support usability by speaking user's language, and by providing a systematic assistance.},
}
-
Sébastien Ferré.
SQUALL: The expressiveness of SPARQL 1.1 made available as a controlled natural language.
Data & Knowledge Engineering,
94:163-188,
2014.
[WWW]
[doi:10.1016/j.datak.2014.07.010]
Keyword(s): controlled natural language,
semantic web,
RDF,
SPARQL,
expressiveness.
Abstract: |
The Semantic Web (SW) is now made of billions of triples, which are available as Linked Open Data (LOD) or as RDF stores. The SPARQL query language provides a very expressive way to search and explore this wealth of semantic data. However, user-friendly interfaces are needed to bridge the gap between end-users and SW formalisms. Navigation-based interfaces and natural language interfaces require no or little training, but they cover a small fragment of SPARQL's expressivity. We propose SQUALL, a query and update language that provides the full expressiveness of SPARQL~1.1 through a flexible controlled natural language (e.g., solution modifiers through superlatives, relational algebra through coordinations, filters through comparatives). A comprehensive and modular definition is given as a Montague grammar, and an evaluation of naturalness is done on the QALD challenge. SQUALL is conceived as a component of natural language interfaces, to be combined with lexicons, guided input, and contextual disambiguation. It is available as a Web service that translates SQUALL sentences to SPARQL, and submits them to SPARQL endpoints (e.g., DBpedia), therefore ensuring SW compliance, and leveraging the efficiency of SPARQL engines. |
@Article{Fer2014dke,
author = {Sébastien Ferré},
title = {{SQUALL}: The expressiveness of {SPARQL} 1.1 made available as a controlled natural language},
journal = {Data \& Knowledge Engineering},
volume = {94},
pages = {163-188},
year = {2014},
doi = {10.1016/j.datak.2014.07.010},
url = {http://authors.elsevier.com/sd/article/S0169023X1400069X},
keywords = {controlled natural language, semantic web, RDF, SPARQL, expressiveness},
abstract = {The Semantic Web (SW) is now made of billions of triples, which are available as Linked Open Data (LOD) or as RDF stores. The SPARQL query language provides a very expressive way to search and explore this wealth of semantic data. However, user-friendly interfaces are needed to bridge the gap between end-users and SW formalisms. Navigation-based interfaces and natural language interfaces require no or little training, but they cover a small fragment of SPARQL's expressivity. We propose SQUALL, a query and update language that provides the full expressiveness of SPARQL~1.1 through a flexible controlled natural language (e.g., solution modifiers through superlatives, relational algebra through coordinations, filters through comparatives). A comprehensive and modular definition is given as a Montague grammar, and an evaluation of naturalness is done on the QALD challenge. SQUALL is conceived as a component of natural language interfaces, to be combined with lexicons, guided input, and contextual disambiguation. It is available as a Web service that translates SQUALL sentences to SPARQL, and submits them to SPARQL endpoints (e.g., DBpedia), therefore ensuring SW compliance, and leveraging the efficiency of SPARQL engines.},
}
-
Mouhamadou Ba,
Sébastien Ferré,
and Mireille Ducassé.
Convertibility between input and output types to help compose services in bioinformatics.
In Colloque africain sur la recherche en informatique et mathématiques appliquées (CARI),
pages 141-148,
2014.
@inproceedings{ba2014cari,
author = {Mouhamadou Ba and Sébastien Ferré and Mireille Ducassé},
title = {Convertibility between input and output types to help compose services in bioinformatics},
booktitle={Colloque africain sur la recherche en informatique et mathématiques appliquées ({CARI})},
pages = {141--148},
year={2014},
}
-
Mouhamadou Ba,
Sébastien Ferré,
and Mireille Ducassé.
Convertibilité entre types d'entrée et de sortie pour la composition de services en bio-informatique.
In Conf. Reconnaissance de Formes et Intelligence Artificielle (RFIA),
2014.
@inproceedings{ba2014rfia,
title={Convertibilité entre types d'entrée et de sortie pour la composition de services en bio-informatique},
author={Mouhamadou Ba and Sébastien Ferré and Mireille Ducassé},
booktitle={Conf. Reconnaissance de Formes et Intelligence Artificielle ({RFIA})},
year={2014},
}
-
Mouhamadou Ba,
Sébastien Ferré,
and Mireille Ducassé.
Generating Data Converters to Help Compose Services in Bioinformatics Workflows.
In Hendrick Decker et al., editor,
Int. Conf. Database and Expert Systems Applications (DEXA),
LNCS 8644,
pages 284-298,
2014.
Springer.
Keyword(s): workflow,
bioinformatic,
data converter,
convertibility,
rule system.
Abstract: |
Heterogeneity of data and data formats in bioinformatics often entail a mismatch between inputs and outputs of different services, making it difficult to compose them into workflows. To reduce those mismatches bioinformatics platforms propose ad'hoc converters written by hand. This article proposes to systematically detect convertibility from output types to input types. Convertibility detection relies on abstract types, close to XML Schema, allowing to abstract data while precisely accounting for its composite structure. Detection is accompanied by an automatic generation of converters between input and output XML data. Our experiment on bioinformatics services and datatypes, performed with an implementation of our approach, shows that the detected convertibilities and produced converters are relevant from a biological point of view. Furthermore they automatically produce a graph of potentially compatible services with a connectivity higher than with the ad'hoc approaches. |
@inproceedings{ba2014dexa,
author = {Mouhamadou Ba and Sébastien Ferré and Mireille Ducassé},
title = {Generating Data Converters to Help Compose Services in Bioinformatics Workflows},
booktitle = {Int. Conf. Database and Expert Systems Applications ({DEXA})},
editor = {Hendrick Decker {et al.}},
series = {LNCS 8644},
pages = {284--298},
year = {2014},
publisher = {Springer},
keywords = {workflow, bioinformatic, data converter, convertibility, rule system},
abstract = {Heterogeneity of data and data formats in bioinformatics often entail a mismatch between inputs and outputs of different services, making it difficult to compose them into workflows. To reduce those mismatches bioinformatics platforms propose ad'hoc converters written by hand. This article proposes to systematically detect convertibility from output types to input types. Convertibility detection relies on abstract types, close to XML Schema, allowing to abstract data while precisely accounting for its composite structure. Detection is accompanied by an automatic generation of converters between input and output XML data. Our experiment on bioinformatics services and datatypes, performed with an implementation of our approach, shows that the detected convertibilities and produced converters are relevant from a biological point of view. Furthermore they automatically produce a graph of potentially compatible services with a connectivity higher than with the ad'hoc approaches.},
}
-
Sébastien Ferré.
Expressive and Scalable Query-Based Faceted Search over SPARQL Endpoints.
In P. Mika,
T. Tudorache,
A. Bernstein,
C. Welty,
C. A. Knoblock,
D. Vrandecic,
P. T. Groth,
N. F. Noy,
K. Janowicz,
and C. A. Goble, editors,
The Semantic Web (ISWC),
LNCS 8797,
pages 438-453,
2014.
Springer.
Note: Nominee for the best research paper award.
[WWW]
Keyword(s): SPARQL endpoints,
semantic search,
faceted search,
user interaction,
SPARQL queries,
query-based faceted search,
expressivity,
scalability,
portability,
usability,
Sparklis.
Abstract: |
Linked data is increasingly available through SPARQL endpoints, but exploration and question answering by regular Web users largely remain an open challenge. Users have to choose between the expressivity of formal languages such as SPARQL, and the usability of tools based on navigation and visualization. In a previous work, we have proposed Query-based Faceted Search (QFS) as a way to reconcile the expressivity of formal languages and the usability of faceted search. In this paper, we further reconcile QFS with scalability and portability by building QFS over SPARQL endpoints. We also improve expressivity and readability. Many SPARQL features are now covered: multidimensional queries, union, negation, optional, filters, aggregations, ordering. Queries are now verbalized in English, so that no knowledge of SPARQL is ever necessary. All of this is implemented in a portable Web application, Sparklis, and has been evaluated on many endpoints and questions. |
@inproceedings{Fer2014iswc,
author = {Sébastien Ferré},
title = {Expressive and Scalable Query-Based Faceted Search over {SPARQL} Endpoints},
booktitle = {The Semantic Web ({ISWC})},
pages = {438--453},
year = {2014},
url = {http://dx.doi.org/10.1007/978-3-319-11915-1_28},
editor = {P. Mika and T. Tudorache and A. Bernstein and C. Welty and C. A. Knoblock and D. Vrandecic and P. T. Groth and N. F. Noy and K. Janowicz and C. A. Goble},
series = {LNCS 8797},
publisher = {Springer},
note = {Nominee for the best research paper award},
keywords = {SPARQL endpoints, semantic search, faceted search, user interaction, SPARQL queries, query-based faceted search, expressivity, scalability, portability, usability, Sparklis},
abstract = {Linked data is increasingly available through SPARQL endpoints, but exploration and question answering by regular Web users largely remain an open challenge. Users have to choose between the expressivity of formal languages such as SPARQL, and the usability of tools based on navigation and visualization. In a previous work, we have proposed Query-based Faceted Search (QFS) as a way to reconcile the expressivity of formal languages and the usability of faceted search. In this paper, we further reconcile QFS with scalability and portability by building QFS over SPARQL endpoints. We also improve expressivity and readability. Many SPARQL features are now covered: multidimensional queries, union, negation, optional, filters, aggregations, ordering. Queries are now verbalized in English, so that no knowledge of SPARQL is ever necessary. All of this is implemented in a portable Web application, Sparklis, and has been evaluated on many endpoints and questions.},
}
-
Sébastien Ferré.
SPARKLIS: a SPARQL Endpoint Explorer for Expressive Question Answering.
In M. Horridge,
M. Rospocher,
and J. van Ossenbruggen, editors,
ISWC Posters & Demonstrations Track,
volume 1272 of CEUR Workshop Proceedings,
pages 45-48,
2014.
CEUR-WS.org.
[WWW]
Keyword(s): demo,
SPARQL endpoints,
semantic search,
faceted search,
user interaction,
SPARQL queries,
query-based faceted search,
expressivity,
scalability,
portability,
usability,
Sparklis.
Abstract: |
SPARKLIS is a Semantic Web tool that helps users explore SPARQL endpoints by guiding them in the interactive building of questions and answers, from simple ones to complex ones. It combines the fine-grained guidance of faceted search, most of the expressivity of SPARQL, and the readability of (controlled) natural languages. No endpoint-specific configuration is necessary, and no knowledge of SPARQL and the data schema is required from users. This demonstration paper is a companion to the research paper~\cite{Fer2014iswc}. |
@inproceedings{Fer2014demo,
author = {Sébastien Ferré},
title = {{SPARKLIS:} a {SPARQL} Endpoint Explorer for Expressive Question Answering},
booktitle = {{ISWC} Posters {\&} Demonstrations Track},
pages = {45--48},
year = {2014},
url = {http://ceur-ws.org/Vol-1272/paper_39.pdf},
editor = {M. Horridge and M. Rospocher and J. van Ossenbruggen},
series = {{CEUR} Workshop Proceedings},
volume = {1272},
publisher = {CEUR-WS.org},
keywords = {demo, SPARQL endpoints, semantic search, faceted search, user interaction, SPARQL queries, query-based faceted search, expressivity, scalability, portability, usability, Sparklis},
abstract = {SPARKLIS is a Semantic Web tool that helps users explore SPARQL endpoints by guiding them in the interactive building of questions and answers, from simple ones to complex ones. It combines the fine-grained guidance of faceted search, most of the expressivity of SPARQL, and the readability of (controlled) natural languages. No endpoint-specific configuration is necessary, and no knowledge of SPARQL and the data schema is required from users. This demonstration paper is a companion to the research paper~\cite{Fer2014iswc}.},
}