-
Denis Béchet and Annie Foret.
A Pregroup Toolbox for Parsing and Building Grammars of Natural Languages.
Linguistic Analysis Journal,
36,
2010.
Note: To appear.
@Article{Foret09b,
author = {Denis Béchet and Annie Foret},
title = {A Pregroup Toolbox for Parsing and Building Grammars of Natural Languages},
journal = {Linguistic Analysis Journal},
volume = {36},
year = {2010},
note = {to appear},
keywords = {},
Abstract={}
}
-
Mireille Ducassé and Sébastien Ferré.
Aide à la décision multicritère : cohérence et équité grâce à l'analyse de concepts.
Revue internationale de systémique complexe et d'études relationnelles, Nouvelles Perspectives en Sciences Sociales,
5(2):181-196,
Mai 2010.
@Article{ducasse10,
x-editorial-board = {yes},
x-international-audience = {yes},
Author={Mireille Ducassé and Sébastien Ferré},
Title={Aide à la décision multicritère : cohérence et équité grâce à l'analyse de concepts},
Pages={181-196},
Journal={Revue internationale de systémique complexe et d'études relationnelles, Nouvelles Perspectives en Sciences Sociales},
Publisher ={Prise de parole, Université Laurentienne, Canada},
Year={2010},
Volume={5},
Number={2},
Month={Mai},
}
-
Annie Foret.
A modular and parameterized presentation of pregroup calculus.
Information and Computation Journal,
208(5):395-604,
May 2010.
[PDF]
Keyword(s): Pregroups,
Lambek categorial grammars,
Logic functor,
Logic component,
Cut elimination.
Abstract: |
The concept of pregroup was introduced by Lambek for natural language analysis, with a close link to non-commutative linear logic. We reformulate the pregroup calculus so as to extend it by composition with other logics and calculi. The cut elimination property and the decidability property of the sequent calculus proposed in the article are shown. Properties of composed calculi are also discussed. |
@Article{Foret09d,
author = {Annie Foret},
title = {A modular and parameterized presentation of pregroup calculus},
journal = {Information and Computation Journal},
volume = {208},
number = {5},
pages = {395-604},
year = {2010},
month = {may},
pdf ={http://dx.doi.org/10.1016/j.ic.2009.03.010},
keywords = {Pregroups, Lambek categorial grammars, Logic functor, Logic component, Cut elimination},
abstract={The concept of pregroup was introduced by Lambek for natural language analysis, with a close link to non-commutative linear logic. We reformulate the pregroup calculus so as to extend it by composition with other logics and calculi. The cut elimination property and the decidability property of the sequent calculus proposed in the article are shown. Properties of composed calculi are also discussed.},
}
-
Pierre Allard and Sébastien Ferré.
Recherche de dépendances fonctionnelles et de règles d'association avec OLAP.
In S. Ben Yahia and J.-M. Petit, editors,
Extraction et Gestion des Connaissances,
volume RNTI-E-19 of Revue des Nouvelles Technologies de l'Information,
pages 651-652,
2010.
Cépaduès-Éditions.
Keyword(s): association rule,
functional dependency,
OLAP,
navigation.
Abstract: |
Dans le domaine des bases de données, les outils de calcul de règles d'association et de dépendances fonctionnelles affichent traditionnellement les résultats sous forme d'une liste de règles, difficiles à lire. Nous proposons ici de projeter une relation d'une base de données sur un cube de données OLAP, afin d'afficher ces règles de manière plus structurée et plus intuitive. De plus, nous montrons que les liens de navigation d'OLAP peuvent aider l'utilisateur à naviguer dans ces règles produites. |
@inproceedings{AlaFer2010,
author = {Pierre Allard and Sébastien Ferré},
title = {Recherche de dépendances fonctionnelles et de règles d'association avec {OLAP}},
booktitle = {Extraction et Gestion des Connaissances},
year = {2010},
pages = {651-652},
editor = {S. Ben~Yahia and J.-M. Petit},
publisher = {Cépaduès-Éditions},
series = {Revue des Nouvelles Technologies de l'Information},
volume = {RNTI-E-19},
keywords = {association rule, functional dependency, OLAP, navigation},
abstract = {Dans le domaine des bases de données, les outils de calcul de règles d'association et de dépendances fonctionnelles affichent traditionnellement les résultats sous forme d'une liste de règles, difficiles à lire. Nous proposons ici de projeter une relation d'une base de données sur un cube de données OLAP, afin d'afficher ces règles de manière plus structurée et plus intuitive. De plus, nous montrons que les liens de navigation d'OLAP peuvent aider l'utilisateur à naviguer dans ces règles produites.},
}
-
Pierre Allard,
Sébastien Ferré,
and Olivier Ridoux.
Discovering Functional Dependencies and Association Rules by Navigating in a Lattice of OLAP Views.
In M. Kryszkiewicz and S. Obiedkov, editors,
Concept Lattices and Their Applications,
pages 199-210,
2010.
CEUR-WS.
Keyword(s): Functional Dependencies,
Association Rules,
FCA,
OLAP,
Navigation.
Abstract: |
Discovering dependencies in data is a well-know problem in database theory. The most common rules are Functional Dependencies (FDs), Conditional Functional Dependencies (CFDs) and Association Rules (ARs). Many tools can display those rules as lists, but those lists are often too long for inspection by users. We propose a new way to display and navigate through those rules. Display is based on On-Line Analytical Processing (OLAP), presenting a set of rules as a cube, where dimensions correspond to the premises of rules. Cubes reflect the hierarchy that exists between FDs, CFDs and ARs. Navigation is based on a lattice, where nodes are OLAP views, and edges are OLAP navigation links, and guides users from cube to cube. We present an illustrative example with the help of our prototype. |
@inproceedings{AllardFR10,
author = {Pierre Allard and Sébastien Ferré and Olivier Ridoux},
title = {Discovering Functional Dependencies and Association Rules by Navigating in a Lattice of {OLAP} Views},
booktitle = {Concept Lattices and Their Applications},
year = {2010},
ee = {http://ceur-ws.org/Vol-672/paper18.pdf},
editor = {M. Kryszkiewicz and S. Obiedkov},
publisher = {CEUR-WS},
abstract = {Discovering dependencies in data is a well-know problem in database theory. The most common rules are Functional Dependencies (FDs), Conditional Functional Dependencies (CFDs) and Association Rules (ARs). Many tools can display those rules as lists, but those lists are often too long for inspection by users. We propose a new way to display and navigate through those rules. Display is based on On-Line Analytical Processing (OLAP), presenting a set of rules as a cube, where dimensions correspond to the premises of rules. Cubes reflect the hierarchy that exists between FDs, CFDs and ARs. Navigation is based on a lattice, where nodes are OLAP views, and edges are OLAP navigation links, and guides users from cube to cube. We present an illustrative example with the help of our prototype.},
pages = {199-210},
keywords = {Functional Dependencies, Association Rules, FCA, OLAP, Navigation}
}
-
D. Bechet,
A. Dikovsky,
and Annie Foret.
Two models of learning iterated dependencies..
In Formal Grammar,
LNCS,
2010.
Springer.
Abstract: |
We study the learnability problem in the family of Categorial Dependency Grammars (CDG), a class of categorial grammars defining unlimited dependency structures. CDG satisfying a reasonable condition on the iterant dependencies are shown to be incrementally learnable in the limit. |
@inproceedings{Foret10b,
author = {D. Bechet and A. Dikovsky and Annie Foret},
title = {Two models of learning iterated dependencies.},
booktitle = {Formal Grammar},
year = {2010},
publisher = {Springer},
series = {LNCS},
abstract = {We study the learnability problem in the family of Categorial Dependency Grammars (CDG), a class of categorial grammars defining unlimited dependency structures. CDG satisfying a reasonable condition on the iterant dependencies are shown to be incrementally learnable in the limit.},
}
-
Peggy Cellier and Thierry Charnois.
Fouille de données séquentielle d'itemsets pour l'apprentissage de patrons linguistiques.
In Traitement Automatique des Langues Naturelles (short paper),
2010.
@inproceedings{CellierC10,
author = {Peggy Cellier and Thierry Charnois},
title = {Fouille de données séquentielle d'itemsets pour l'apprentissage de patrons linguistiques},
booktitle = {Traitement Automatique des Langues Naturelles (short paper)},
year = {2010}
}
-
Peggy Cellier,
Thierry Charnois,
and Marc Plantevit.
Sequential Patterns to Discover and Characterise Biological Relations.
In A. F. Gelbukh, editor,
Computational Linguistics and Intelligent Text Processing (CICLing),
LNCS 6008,
pages 537-548,
2010.
Springer.
@inproceedings{CellierCP10,
author = {Peggy Cellier and Thierry Charnois and Marc Plantevit},
title = {Sequential Patterns to Discover and Characterise Biological Relations},
booktitle = {Computational Linguistics and Intelligent Text Processing (CICLing)},
year = {2010},
pages = {537-548},
editor = {A. F. Gelbukh},
publisher = {Springer},
series = {LNCS 6008},
isbn = {978-3-642-12115-9}
}
-
Peggy Cellier,
Thierry Charnois,
Marc Plantevit,
and Bruno Crémilleux.
Recursive Sequence Mining to Discover Named Entity Relations.
In Paul R. Cohen,
Niall M. Adams,
and Michael R. Berthold, editors,
Advances in Intelligent Data Analysis IX, 9th International Symposium (IDA),
LNCS 6065,
pages 30-41,
2010.
Springer.
@inproceedings{CellierCPC10,
author = {Peggy Cellier and Thierry Charnois and Marc Plantevit and Bruno Crémilleux},
title = {Recursive Sequence Mining to Discover Named Entity Relations},
booktitle = {Advances in Intelligent Data Analysis IX, 9th International Symposium (IDA)},
year = {2010},
editor = {Paul R. Cohen and Niall M. Adams and Michael R. Berthold},
publisher = {Springer},
series = {LNCS 6065},
isbn = {978-3-642-13061-8},
pages = {30-41}
}
-
Sébastien Ferré.
Conceptual Navigation in RDF Graphs with SPARQL-Like Queries.
In L. Kwuida and B. Sertkaya, editors,
Int. Conf. Formal Concept Analysis,
LNCS 5986,
pages 193-208,
2010.
Springer.
Keyword(s): conceptual navigation,
semantic web,
RDF,
SPARQL,
querying,
navigation.
Abstract: |
Concept lattices have been successfully used for information retrieval and browsing. They offer the advantage of combining querying and navigation in a consistent way. Conceptual navigation is more flexible than hierarchical navigation, and easier to use than plain querying. It has already been applied to formal, logical, and relational contexts, but its application to the semantic web is a challenge because of inference mechanisms and expressive query languages such as SPARQL. The contribution of this paper is to extend conceptual navigation to the browsing of RDF graphs, where concepts are accessed through SPARQL-like queries. This extended conceptual navigation is proved consistent w.r.t. the context (i.e., never leads to an empty result set), and complete w.r.t. the conjunctive fragment of the query language (i.e., every query can be reached by navigation only). Our query language has an expressivity similar to SPARQL, and has a more natural syntax close to description logics. |
@inproceedings{Fer2010,
author = {Sébastien Ferré},
title = {Conceptual Navigation in {RDF} Graphs with {SPARQL}-Like Queries},
booktitle = {Int. Conf. Formal Concept Analysis},
year = {2010},
pages = {193-208},
editor = {L. Kwuida and B. Sertkaya},
publisher = {Springer},
series = {LNCS 5986},
keywords = {conceptual navigation, semantic web, RDF, SPARQL, querying, navigation},
abstract = {Concept lattices have been successfully used for information retrieval and browsing. They offer the advantage of combining querying and navigation in a consistent way. Conceptual navigation is more flexible than hierarchical navigation, and easier to use than plain querying. It has already been applied to formal, logical, and relational contexts, but its application to the semantic web is a challenge because of inference mechanisms and expressive query languages such as SPARQL. The contribution of this paper is to extend conceptual navigation to the browsing of RDF graphs, where concepts are accessed through SPARQL-like queries. This extended conceptual navigation is proved consistent w.r.t. the context (i.e., never leads to an empty result set), and complete w.r.t. the conjunctive fragment of the query language (i.e., every query can be reached by navigation only). Our query language has an expressivity similar to SPARQL, and has a more natural syntax close to description logics.},
}
-
Annie Foret and Sébastien Ferré.
On Categorial Grammars as Logical Information Systems.
In L. Kwuida and B. Sertkaya, editors,
Int. Conf. Formal Concept Analysis,
LNCS 5986,
pages 225-240,
2010.
Springer.
Keyword(s): logical information systems,
categoarial grammar,
pregroup,
browsing.
Abstract: |
We explore different perspectives on how categorial grammars can be considered as Logical Information Systems (LIS) both theoretically, and practically. Categorial grammars already have close connections with logic. We discuss the advantages of integrating both approaches. We consider more generally different ways of connecting computational linguistic data and LIS as an application of Formal Concept Analysis. |
@inproceedings{ForFer2010,
author = {Annie Foret and Sébastien Ferré},
title = {On Categorial Grammars as Logical Information Systems},
booktitle = {Int. Conf. Formal Concept Analysis},
year = {2010},
pages = {225-240},
editor = {L. Kwuida and B. Sertkaya},
publisher = {Springer},
series = {LNCS 5986},
keywords = {logical information systems, categoarial grammar, pregroup, browsing},
abstract = {We explore different perspectives on how categorial grammars can be considered as Logical Information Systems (LIS) both theoretically, and practically. Categorial grammars already have close connections with logic. We discuss the advantages of integrating both approaches. We consider more generally different ways of connecting computational linguistic data and LIS as an application of Formal Concept Analysis.},
}