Emmanuel Desmontils

LSEQ: an adaptive structure for sequences in distributed collaborative editing

Distributed collaborative editing systems allow users to work distributed in time, space and across organizations. Trending distributed collaborative editors such as Google Docs, Etherpad or Git have grown in popularity over the years. A new kind of distributed editors based on a family of distributed data structure replicated on several sites called Conflict-free Replicated Data Type (CRDT for short) appeared recently. This paper considers a CRDT that represents a distributed sequence of basic elements that can be lines, words or characters (sequence CRDT). The possible operations on this sequence are the insertion and the deletion of elements. Compared to the state of the art, this approach is more decentralized and better scales in terms of the number of participants. However, its space complexity is linear with respect to the total number of inserts and the insertion points in the document. This makes the overall performance of such editors dependent on the editing behaviour of users. This paper proposes and models LSEQ, an adaptive allocation strategy for a sequence CRDT. LSEQ achieves in the average a sub-linear spatial-complexity whatever is the editing behaviour. A series of experiments validates LSEQ showing that it outperforms existing approaches.

French EuroWordNet Lexical Database Improvements

Semantic knowledge is often used in the framework of Natural Language Processing (NLP) applications. However, for some languages different from English, such knowledge is not always easily available. In fact, for example, French thesaurus are not numerous and are not enough developed. In this context, we present two modifications made on the French version of the EuroWordnet Thesaurus in order to improve it. Firstly, we present the French EuroWordNet thesaurus and its limits. Then we explain two improvements we have made. We add non-existing relationships by using the bilinguism capability of the EuroWordnet thesaurus, and definitions by using an external multilingual resource (Wikipedia [1]).

A Web site indexing process for an Internet information retrieval agent system

Bonom is a distributed agent based system to perform information retrieval on the Internet. The middle agents which perform the matching between site agents (information providers) and user agents (requesters) are numerous and can be world wide distributed. Moreover, the agents are structured into nested communities according to a hierarchy of information domains. This paper focuses on a Web site indexing process which uses disambiguated ontologies. It allows the site agent to know to which communities it has to subscribe to, in order to get requests it can accurately process.

Dinosys: An Annotation Tool for Web-Based Learning

The main function of freeform annotation systems is to improve exchange, communication and interoperability on the Web. The purpose of this paper is on the one hand, to make a synthesis of the characteristics of the annotations and architectures of annotation systems, and on the other hand to propose a new architecture for an annotation system which is easy to use, lightweight, efficient, non-intrusive, scaleable, shared and platform-independent. The use of this tool within the e-learning framework is also studied.

Knowledge continuous integration process (K-CIP)

Social semantic web creates read/write spaces where users and smart agents collaborate to produce knowledge readable by humans and machines. An important issue concerns the ontology evolution and evaluation in man-machine collaboration. How to perform a change on ontologies in a social semantic space that currently use these ontologies through requests? In this paper, we propose to implement a continuous knowledge integration process named K-CIP. We take advantage of man-machine collaboration to transform feedback of people into tests. This paper presents how K-CIP can be deployed to allow fruitful man-machine collaboration in the context of the Wikitaaable system.

Expressing constraint satisfaction problems in declarative modeling using natural language and fuzzy sets

Abstract The aim of this paper is to provide a new model of fuzzy or vague properties according to linguistic notions within the scope of declarative modeling and constraint satisfaction problems (CSPs). Some generic modifiers and generic fuzzy operators are applied on these properties. This model allows us to build a CSP according a pseudo-natural scene description. Solving this CSP provides possible scenes. Moreover, we propose a linguistic interpretation of negative properties instead of the classical logical negation. This negation process selects plausible properties as linguistic negation. Then, it sorts them to provide first the ones that have the best chance to be selected by the user.

The answer validation system ProdicosAV dedicated to French

In this paper, we present the ProdicosAV answer validation system which was developed by the NLP team from the LINA institute. ProdicosAV system is based on the Prodicos System which participated two years ago in the Question Answering CLEF evaluation campaign for French. We firstly present the modifications made on Prodicos to improve it and to adapt it to a new kind of exercise. We present in details the ranking passage module and the temporal validator module. Secondly, the answer-validation module dedicated to the AVE task is presented. Finally, the evaluation is put forward to justify the results obtained.

The query answering system PRODICOS

In this paper, we present the PRODICOS query answering system which was developed by the TALN team from the LINA institute. We present the various modules constituting our system and for each of them the evaluation is shown. Afterwards, for each of them, the evaluation is put forward to justify the results obtained. Then, we present the main improvement based on the use of semantic data.

FETA:Federated QuEry TrAcking for Linked Data

Following the principles of Linked Data (LD), data providers are producing thousands of interlinked datasets in multiple domains including life science, government, social networking, media and publications. Federated query engines allow data consumers to query several datasets through a federation of SPARQL endpoints. However, data providers just receive subqueries resulting from the decomposition of the original federated query. Consequently, they do not know how their data are crossed with other datasets of the federation. In this paper, we propose FETA, a Federated quEry TrAcking system for LD. We consider that data providers collaborate by sharing their query logs. Then, from a federated log, FETA infers Basic Graph Patterns (BGPs) containing joined triple patterns, executed among endpoints. We experimented FETA with logs produced by FedBench queries executed with Anapsid and FedX federated query engines. Experiments show that FETA is able to infer BGPs of joined triple patterns with a good precision and recall.

Question types specification for the use of specialized patterns in prodicos system

We present the second version of the Prodicos query answering system which was developed by the TALN team from the LINA institute. The main improvements made concern in the one hand, the use of external knowledge (Wikipedia) to improve the passage selection step. And on the other hand, the answer extraction step is improved by the determination of four different strategies for locating the answer to a question regarding its type. Afterwards, for the passage selection and answer extraction modules, the evaluation is put forward to justify the results obtained.