Search in ATOLL bibliography

all | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1990 | 1989 | PS|PDF|HTML BIB|Raw BIB|Submit

Year:

Type:

Search: (please use the notation of Alta Vista simple queries)

Key search


Année 2007

Communications à des congrés, colloques, etc.

[1]
Large-scale knowledge acquisition from botanical texts. In Proc. of NLDB'07, 2007.
François Role, Milagros Fernandez Gavilanes, and Éric Villemonte de la Clergerie.
[BibTeX]

[2]
Mining parsing results for lexical corrections. In Proc. of the 3rd Language & Technology Conference (LTC), Poznan, Poland, October 2007.
Lionel Nicolas, Jacques Farré, and Éric Villemonte de la Clergerie.
[BibTeX]

[3]
Confondre le coupable: Corrections d'un lexique suggérées par une grammaire. In Proc. of TALN'07, 2007.
Lionel Nicolas, Jacques Farré, and Éric Villemonte de la Clergerie.
[BibTeX]

[4]
Knowledge acquisition through error-mining. In Proc. of International Conference RANLP'07, Borovets, Bulgaria, 2007.
Milagros Fernandez, Éric Villemonte de La Clergerie, and Manuel Vilares.
[BibTeX]

[5]
From text to knowledge. In Proc. of EUROCAST'07 (Eleven international conference on Computer Aided Systems theory), 2007.
Milagros Fernandez, Éric Villemonte de La Clergerie, and Manuel Vilares.
[BibTeX]

Année 2006

Livres et monographies

[6]
Designing tabular parsers for various syntactic formalisms. The association for Logic, Language and Information (FOLLI), Malaga, Spain, July-August 2006. Tutorial delivered at the 18th European Summer School in Logic, language and information (ESSLLI'06),
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]
The aim of this course is to introduce chart-based (or tabular) parsing techniques found in Natural Language Processing and to illustrate them on several large classes of syntactic formalisms (Context-Free Grammars, Unification-based grammars, Tree Adjoining Grammars [TAGs] with, possibly, generalizations to other Mildly-Context Sensitive formalisms). The course will focus on designing such tabular algorithms for new formalisms by providing some intuition about how they work and by examining complexity issues (both on theoretical and practical aspects). The course will also emphasize the notion of shared derivation forest as parsing output and its potential use, during or after parsing.

Thèses et habilitations à diriger des recherches

[7]
Analyse automatique du français: lexiques, formalismes, analyseurs. PhD thesis, Université Paris 7, April 2006. PhD thesis, supervized by Laurence Danlos (Lattice, Université Paris 7) and co-supervized by Éric de La Clergerie (Atoll, INRIA Rocquencourt),
Benoît Sagot.
[BibTeX]

Articles et chapitres de livre

[8]
Améliorer un lexique syntaxique à l'aide des tables du lexique-grammaire – constructions impersonnelles et expressions verbales figées. Cahiers du Cental, 2006. submitted. Revised version for post publication of DLTAF 2006,
Benoît Sagot and Laurence Danlos.
[BibTeX]
This paper shows how a careful understanding of some linguistic phenomena and their modeling in the lexicon-grammar tables can help enriching the Lefff, a large-coverage NLP-oriented syntactic lexicon for French. We show how we appied this approach to handle satisfyingly all kind of impersonal constructions, and present a first draft of operational modeling for verbal idioms.


[9]
Construction incrémentale d'une ontologie par analyse du texte et de la structure des documents. Document numérique, 9(1):77–92, 2006.
François Role and Guillaume Rousse.
[BibTeX]

[10]
Non-lexical chart parsing for TAG, chapter Complexity of Lexical Descriptions and its Relevance to Natural Language Processing: A Supertagging Approach. MIT Press, 2006.
Alexis Nasr and Owen Rambow.
[BibTeX]

[11]
Grammaires de dépendances génératives probabilistes. modèle théorique et application à un corpus arboré du français. Traitement Automatique des Langues, 46(1):115–153, 2006.
Alexis Nasr.
[BibTeX]

Communications à des congrés, colloques, etc.

[12]
Modélisation et analyse des coordinations elliptiques via l'exploitation dynamique des forets de dérivation. In Proc. of TALN'06 (poster), pages 609–618, 2006.
Djamé Seddah and Benoît Sagot.
[BibTeX] [PDF]

[13]
Modeling and analysis of elliptic coordination by dynamic exploitation of derivation forests in ltag parsing. In Proceedings of TAG+8, pages 147–152, Sydney, Australia, July 2006.
Djamé Seddah and Benoît Sagot.
[BibTeX]
In this paper, we introduce a generic approach to elliptic coordination modeling through the parsing of LTAG grammars. We show that erased lexical items can be replaced during parsing by informations gathered in the other member of the coordinate structure and used as a guide at the derivation level. Moreover, we show how this approach can be indeed implemented as a light extension of the LTAG formalism throuh a so-called "fusion" operation and by the use of tree schemas during parsing in order to obtain a dependency graph.


[14]
Trouver le coupable : Fouille d'erreurs sur des sorties d'analyseurs syntaxiques. In Proc. of TALN'06, pages 287–296, 2006. Prix du meilleur papier,
Benoît Sagot and Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]
Nous présentons une méthode de fouille d'erreurs pour détecter automatiquement des erreurs dans les ressources utilisées par les systèmes d'analyse syntaxique. Nous avons mis en oeuvre cette méthode sur le résultat de l'analyse de plusieurs millions de mots par deux systèmes d'analyse différents qui ont toutefois en commun le lexique syntaxique et la chaîne de traitement pré-syntaxique. Nous avons pu identifier ainsi des inexactitudes et des incomplétudes dans les ressources utilisées. En particulier, la comparaison des résultats obtenus sur les sorties des deux analyseurs sur un même corpus nous a permis d'isoler les problèmes issus des ressources partagées de ceux issus des grammaires.


[15]
Error mining in parsing results. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 329–336, Sydney, Australia, July 2006. Association for Computational Linguistics.
Benoît Sagot and Éric Villemonte de La Clergerie.
[BibTeX] [URL] [Slides]

[16]
Améliorer un lexique syntaxique à l'aide des tables du lexique-grammaire. In Actes du colloque DLTAF 2006 (Description Linguistique pour le Traitement Automatique du Français) du congres de l'ACFAS, Montréal, Canada, 2006.
Benoît Sagot and Laurence Danlos.
[BibTeX]

[17]
The Lefff 2 syntactic lexicon for french: architecture, acquisition, use. In Proc. of LREC'06, 2006.
Benoît Sagot, Lionel Clément, Éric Villemonte de La Clergerie, and Pierre Boullier.
[BibTeX] [PDF]

[18]
French frozen verbal expressions: from lexicon-grammar tables to NLP applications. In Actes du Colloque Lexique et Grammaire 2006, 2006.
Laurence Danlos, Benoît Sagot, and Susanne Salmon-Alt.
[BibTeX] [PDF]

[19]
Efficient parsing of large corpora with a deep LFG parser. In Proc. of LREC'06, 2006.
Pierre Boullier and Benoît Sagot.
[BibTeX] [PDF]

[20]
Un analyseur morphologique multi-niveaux utilisant la jointure. In Proc. of TALN'06, 2006.
Francois Barthélemy.
[BibTeX]

Divers

[21]
Mining errors in large corpus parsing output, March 2006. Slides presented at Univ. of Vigo, Spain,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

[22]
From meta-grammars to factorized grammars, March 2006. Slides presented at Univ. of La Coruña, Spain,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

[23]
Atoll: Software tools for natural language processing, March 2006. Slides presented at Univ. of Vigo, Spain,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

[24]
Fouille d'erreurs en analyse syntaxique. Master's thesis, University of Nice, Master Recherche PLMT, September 2006.
Lionel Nicolas.
[BibTeX] [PDF]

[25]
Mieux comprendre les méta-grammaires. Master's thesis, Université Paris 6, September 2006.
Julien Martin.
[BibTeX] [PDF]

Année 2005

Articles et chapitres de livre

[26]
From raw corpus to word lattices: robust pre-parsing processing. Archives of Control Sciences, special issue of selected papers from LTC'05, 15(4):653–662, 2005.
Benoît Sagot and Pierre Boullier.
[BibTeX] [PDF]

[27]
Réflexion sur les mécanismes de contrôle de la communication et de l'économie. Expertises, (296):330–335, October 2005.
Bernard Lang and Monique Linglet.
[BibTeX]

[28]
Matching with multiplication and exponentiation. Mathematical Structures in Computer Science, 15(05):959–968, October 2005.
Bernard Lang.
[BibTeX]

[29]
Logiciels libres et développement. la revue nouvelle, (6-7):56–62, juin-juillet 2005.
Bernard Lang.
[BibTeX]

[30]
Libres, les logiciels ! CAES magazine, (77), hiver 2005. to appear,
Bernard Lang.
[BibTeX]

[31]
Brevet, logiciel libre et innovation. La vie de la recherche scientifique, (360):18–21, February 2005.
Bernard Lang.
[BibTeX]

[32]
Analyse syntaxique profonde à grande échelle: SxLFG. Traitement Automatique des Langues (T.A.L.), 2005. to appear,
Pierre Boullier and Benoît Sagot.
[BibTeX]

[33]
a non-statistical parsing-based approach. MIT Press, 2005. to appear,
Pierre Boullier.
[BibTeX]

Communications à des congrés, colloques, etc.

[34]
From metagrammars to factorized TAG/TIG parsers. In Proceedings of IWPT'05 (poster), pages 190–191, Vancouver, Canada, October 2005.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[35]
DyALog: a tabular logic programming based environment for NLP. In Proceedings of 2nd International Workshop on Constraint Solving and Language Processing (CSLP'05), Barcelona, Spain, October 2005.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[36]
Comment obtenir plus des méta-grammaires. In Proceedings of TALN'05, Dourdan, France, June 2005. ATALA.
François Thomasset and Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[37]
From raw corpus to word lattices: robust pre-parsing processing. In proc. of the 2nd Language & Technology Conference (LT'05), pages 348–351, Poznan, Poland, April 2005. Selected for potential journal publication,
Benoît Sagot and Pierre Boullier.
[BibTeX] [PDF]

[38]
Linguistic facts as predicates over ranges of the sentence. In Lecture Notes in Computer Science 3492 (© Springer-Verlag), Proceedings of LACL'05, pages 271–286, Bordeaux, France, April 2005.
Benoît Sagot.
[BibTeX] [PDF]

[39]
Les Méta-RCG: description et mise en oeuvre. In Proceedings of TALN'05 (poster), pages 493–498, Dourdan, France, June 2005. ATALA.
Benoît Sagot.
[BibTeX] [PDF]

[40]
Automatic acquisition of a Slovak lexicon from a raw corpus. In Lecture Notes in Artificial Intelligence 3658 (© Springer-Verlag), Proceedings of TSD'05, pages 156–163, Karlovy Vary, Czech Republic, September 2005.
Benoît Sagot.
[BibTeX] [PDF]

[41]
Analyse automatique de documents botaniques: le projet Biotim. In proc. of TIA'05, pages 95–104, Rouen, France, April 2005.
Guillaume Rousse and Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[42]
On expressing vague quantification and scalar implicatures in the logic of partial information. In Lecture Notes in Computer Science 3492 (© Springer-Verlag), Proceedings of LACL'05, Bordeaux, France, April 2005.
Areski Nait Abdallah and Alain Lecomte.
[BibTeX] [PS]

[43]
Software patentability: a computer research scientist's view. In Comptes-rendus de la Conférence LacFree 2005, Recife-Olinda (Brésil), December 2005. Extended version of a French version,
Bernard Lang.
[BibTeX]

[44]
Brevetabilité du logiciel : le point de vue d'un chercheur en informatique. In Bernard Remiche, editor, Actes du Colloque "Brevet - Innovation - Intérêt général". Chaire Arcelor, 2005. To appear,
Bernard Lang.
[BibTeX]

[45]
MAF: a morphosyntactic annotation framework. In proc. of the 2nd Language & Technology Conference (LT'05), pages 90–94, Poznan, Poland, April 2005.
Lionel Clément and Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[46]
Un analyseur LFG efficace pour le français: SXLFG. In Proceedings of TALN'05 (poster), pages 403–408, Dourdan, France, June 2005. ATALA.
Pierre Boullier, Benoît Sagot, and Lionel Clément.
[BibTeX] [PDF]

[47]
Efficient and robust LFG parsing: SxLfg. In Proceedings of IWPT'05, pages 1–10, Vancouver, Canada, October 2005.
Pierre Boullier and Benoît Sagot.
[BibTeX] [PDF]

[48]
« simple comme easy :-) ». In Proceedings of TALN'05 EASy Workshop (poster), pages 57–60, Dourdan, France, June 2005. ATALA.
Pierre Boullier, Lionel Clément, Benoît Sagot, and Éric Villemonte de La Clergerie.
[BibTeX] [PDF]

[49]
Chaînes de traitement syntaxique. In Proceedings of TALN'05, pages 103–112, Dourdan, France, June 2005. ATALA.
Pierre Boullier, Lionel Clément, Benoît Sagot, and Éric Villemonte de La Clergerie.
[BibTeX] [PDF]

[50]
Partitioning multitape transducers. In Finite State Methods in Natural Language Processing (FSMNLP'05), Helsinki (Finland), September 2005.
François Barthélemy.
[BibTeX]

Rapports de recherche et publications internes

[51]
Terminology and other language resources – morpho-syntactic annotation framework (MAF). Committe Draft ISO TC37 SC4 WG2 N119 Rev3, ISO, October 2005. Submitted for CD ballot,
Éric Villemonte de La Clergerie.
[BibTeX]
A preliminary proposal to standardize morphosyntactic annotations.

Divers

[52]
From meta-grammars to factorized grammars, October 2005. Slides presented at IULA, Universitat Pompeu Fabra, Barcelona,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

[53]
Concevoir des analyseurs syntaxiques avec dyalog à partir de méta-grammaires, January 2005. Slides presented at TALaNa, University Paris 7,
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]

[54]
Vers un méta-lexique pour le français : architecture, acquisition, utilisation. Journée d'étude de l'ATALA sur l'Interface lexique-grammaire et lexiques syntaxiques et sémantiques, March 2005,
Benoît Sagot, Lionel Clément, Éric Villemonte de La Clergerie, and Pierre Boullier.
[BibTeX] [PDF]

Année 2004

Articles et chapitres de livre

[55]
Quel modèle économique pour les créations immatérielles ? Les Nouveaux dossiers de l'Audiovisuel, (1):66–67, septembre-octobre 2004. Institut National de l'Audiovisuel,
Bernard Lang.
[BibTeX]

[56]
Range Concatenation Grammars, volume 23 of Text, Speech and Language Technology, pages 269–289. Kluwer Academic Publishers, 2004.
Pierre Boullier.
[BibTeX] [PDF]

[57]
Relating Tabular Parsing Algorithms for LIG and TAG, volume 23 of Text, Speech and Language Technology, pages 157–184. Kluwer Academic Publishers, 2004. revised notes of a paper for IWPT2000,
Miguel A. Alonso, Éric Villemonte de La Clergerie, Vítor J. Diaz, and Manuel Vilares.
[BibTeX] [PDF]

Communications à des congrés, colloques, etc.

[58]
Coupling grammar and knowledge base: Range concatenation grammars and description logics. In Proceedings of TSD'04, Brno, Tchéquie, 2004.
Benoît Sagot and Adil El Ghali.
[BibTeX] [PDF]

[59]
Les RCG comme formalisme grammatical pour la linguistique. In Actes de TALN'04, pages 403–412, Fès, Maroc, 2004.
Benoît Sagot and Pierre Boullier.
[BibTeX] [PDF]

[60]
Implicatures scalaires, logique de l'information partielle et programmation logique. In Workshop TCAN La construction du savoir scientifique dans la langue, Grenoble, 2004.
M.A. Nait Abdallah and Alain Lecomte.
[BibTeX]

[61]
An algebraic approach to commonsense reasoning. In Proc. Logic Colloquium 2004, European Conference of the Association for Symbolic Logic, Torino (Italy), 2004.
M.A. Nait Abdallah.
[BibTeX]

[62]
Towards an international standard on feature structure representation. In proc. of LREC'04, pages 373–376, May 2004.
Kiyong Lee, Harry Bunt, Syd Bauman, Lou Burnard, Lionel Clément, Tomaz Erjavec, Eric de la Clergerie, Thierry Declerck, Laurent Romary, Azim Roussanaly, and Claude Roux.
[BibTeX] [PDF]

[63]
Morphology based automatic acquisition of large-coverage lexica. In proc. of LREC'04, pages 1841–1844, May 2004.
Lionel Clément, Benoît Sagot, and Bernard Lang.
[BibTeX] [PDF]

Rapports de recherche et publications internes

[64]
Terminology and other language resources – morpho-syntactic annotation framework (MAF). Working Draft ISO TC37 SC4 WG2 N119 Rev2, ISO, July 2004.
Lionel Clément and Éric Villemonte de La Clergerie.
[BibTeX] [PDF]
A preliminary proposal to standardize morphosyntactic annotations.

Divers

[65]
Designing efficient parsers with DyALog, June 2004. Slides presented at GLINT, Universidade Nova de Lisboa,
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]

[66]
Traitement linguistique et informatique de la coordination. Stage X, DIX – École Polytechnique, July 2004.
Tatiana Samoussina.
[BibTeX] [PDF]
Ce mémoire de stage d'Ingénieur de l'École Polytechnique explore l'utilisation active des techniques de tabulation dans DyALog pour traiter certains phénomènes de coordination en TAL.


[67]
Automatized knowledge extraction from paper documents. Poster presented at TDWG'04 (ChristChurch, NZ), October 2004,
Guillaune Rousse.
[BibTeX]

[68]
Traitements de sorties d'analyseurs syntaxique. Master's thesis, DEA Informatique et Systèmes Intelligents Univ. Paris Dauphine, September 2004.
Mehdi Ben Hmida.
[BibTeX] [Word]

Année 2003

Livres et monographies

[69]
Éric Villemonte de La Clergerie and Martin Rajman, editors. Evolutions en Analyse Syntaxique, volume 44 of Traitement Automatique des Langues (T.A.L.). Hermes - Lavoisier, 2003.
[BibTeX]

Articles et chapitres de livre

[70]
Petit panorama des approches en analyse syntaxique. Traitement Automatique des Langues (T.A.L.), 44(3):7–14, 2003.
Éric Villemonte de La Clergerie and Martin Rajman.
[BibTeX] [PDF]

[71]
Liberté et barrières dans l'univers des logiciels. Specif, (50):33–36, December 2003.
Bernard Lang.
[BibTeX]

[72]
La bataille des logiciels libres, volume 22, pages 195–200. Institut Universitaire du Développement, Genève, November 2003. ISSN 1660-5934,
Bernard Lang.
[BibTeX] [URL]

[73]
Counting with range concatenation grammars. Theoretical Computer Science, 293:391–416, 2003.
Pierre Boullier.
[BibTeX]

Communications à des congrés, colloques, etc.

[74]
International standard for a linguistic annotation framework. In Proceedings of HLT-NAACL'03 Workshop on The Software Engineering and Architecture of Language Technology, 2003. Journal version submitted to the special issue of JNLE on Software Architecture for Language Engineering,
N. Ide, L. Romary, and Éric Villemonte de La Clergerie.
[BibTeX] [PDF]

[75]
Generating parallel multilingual LFG-TAG grammars from a metaGrammar. In Proc. of ACL'03, 2003.
Lionel Clément and Alexandra Kinyon.
[BibTeX]

[76]
Generating LFGs with a metaGrammar. In Proc. of Lexical Functional Grammars (LFG'03). CSLI Publications, 2003.
Lionel Clément and Alexandra Kinyon.
[BibTeX]

[77]
Automating the generation of a wide-coverage LFG for French using a metaGrammar. In Proc. of Formal Grammars (FG'03), pages 33–46, 2003.
Lionel Clément and Alexandra Kinyon.
[BibTeX]

[78]
Supertagging: A non-statistical parsing-based approach. In Proceedings of the 8th International Workshop on Parsing Technologies (IWPT 03), pages 55–65, Nancy, France, April 2003.
Pierre Boullier.
[BibTeX] [PDF]

[79]
Guided Earley parsing. In Proceedings of the 8th International Workshop on Parsing Technologies (IWPT 03), pages 43–54, Nancy, France, April 2003.
Pierre Boullier.
[BibTeX] [PDF]

Divers

[80]
Thread automata for mildly context-sensitive languages, May 2003. Slides presented at IRCS, University of Pennsylvania,
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]

[81]
Intégration d'une méthode d'acquisition de terminologie et recherche de relations. Mémoire de DEA, LIFO – Université d'Orléans, September 2003.
Angélique Pochon.
[BibTeX] [PS Compressed]
Ce mémoire de stage DEA s'inscrit dans le cadre d'un projet d'acquisition de connaissances et a pour objectif de représenter le domaine étudié, à savoir la botanique par l'intégration d'une terminologie à la chaîne de traitement existante et par le développement de méthodes d'acquisition de relations


[82]
Structuration de documents. Stage X, DIX – École Polytechnique, July 2003.
Pascal Manchon.
[BibTeX] [PS Compressed]
Ce mémoire de stage Ingénieur X concerne le développement d'un outil générique pour structurer avec des balises un document à partir d'un modèle du document.


[83]
Bases de données XML pour des ressources linguistiques. Stage X, DIX – École Polytechnique, July 2003.
Julien Lafaye.
[BibTeX] [PS Compressed]

Année 2002

Articles et chapitres de livre

[84]
Point de vue des utilisateurs de linux et des logiciels libres. Droit des technologies avancées, 9(1-2):79–97, 2002. ISBN 2-7462-0659-5, ISSN 1255-3093,
Bernard Lang.
[BibTeX]

Communications à des congrés, colloques, etc.

[85]
Parsing mildly context-sensitive languages with thread automata. In Proc. of COLING'02, August 2002.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[86]
Parsing MCS languages with thread automata. In Proc. of TAG+6, May 2002.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[87]
Construire des analyseurs avec DyALog. In Proc. of TALN'02, June 2002.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]
Cet article survole les fonctionnalités offertes par le système DyALog pour construire des analyseurs syntaxiques tabulaires. Offrant la richesse d'un environnement de programmation en logique, DyALog facilite l'écriture de grammaires, couvre plusieurs formalismes et permet le paramétrage de stratégies d'analyse.
This paper is a survey of the functionalities provided by system DyALog to build tabular parsers. Providing the expressiveness of logic programming, DyALog eases the development of grammars, covers several linguistic formalisms, and allows the parametrization of parsing strategies.


[88]
an LFG-type grammar for german based on topological model. In Miriam Butt and Tracy Holloway King, editors, Proceedings of the LFG02 Conference. CSLI Publications, 2002.
Lionel Clément, Kim Gerdes, and Sylvain Kahane.
[BibTeX] [PS Compressed]

Divers

[89]
Etude de filtrage pour la lexicalisation de la grammaire FTAG. Dea, DEA IARFA, Université Paris 6, October 2002.
Fayçal Chami.
[BibTeX]

[90]
Traitement de corpus botaniques. Dea, DEA CHM, Université du Mans, September 2002.
Edwige Fangseu Badjio.
[BibTeX]

Année 2001

Thèses et habilitations à diriger des recherches

[91]
Vers un formalisme abstrait implémentable pour l'étude savante des textes numérisés. PhD thesis, LIFO – Université d'Orléans, May 2001.
François Role.
[BibTeX] [URL]

[92]
Infra-structure for fault detection and correction in text processing. PhD thesis, Université Nouvelle de Lisbonne, 2001. Soutenance à venir. Thèse co-tutelle avec l'Université d'Orléans,
Vitor Jorge Ramos Rocio.
[BibTeX]

Articles et chapitres de livre

[93]
Tabulation for multi-purpose parsing. Grammars, 4(1):41–65, 2001.
Vitor Jorge Rocio, Gabriel Pereira Lopes, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]

[94]
Text-image coupling for editing literary sources. Computer and the Humanities, 2001.
Éric Lecolinet, Laurent Robert, and François Role.
[BibTeX]

[95]
Analyse syntaxique. HERMES, 2001.
François Barthélemy.
[BibTeX]

[96]
A formal definition of Bottom-up Embedded Push-Down Automata and their tabulation technique. In Philippe de Groote, Glyn Morril, and Christian Retoré, editors, Logical Aspects of Computational Linguistics (LACL'01), volume 2099 of Lecture Notes in Artificial Intelligence, pages 44–61. Springer-Verlag, Berlin-Heidelberg-New York, 2001.
Miguel A. Alonso Pardo, Éric Villemonte de La Clergerie, and Manuel Vilares Ferro.
[BibTeX] [PS Compressed]

Communications à des congrés, colloques, etc.

[97]
Refining tabular parsers for TAGs. In Proceedings of NAACL'01, pages 167–174, CMU, Pittsburgh, PA, USA, June 2001.
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]
This paper investigates several refinements of a generic tabular parser for Tree Adjoining Grammars. The resulting parser is simpler and more efficient in practice, even though the worst case complexity is not optimal.


[98]
Dealing with large documents in the digital library : a case study of ETD documents. In Proceedings of the the 5th ICCC/IFIP Conference on Electronic Publishing ELPUB 2001, pages 291–297, July 2001.
François Role, Majid Ihadjadene, and Stéphane Chaudiron.
[BibTeX]

[99]
L'indexation auteur pour le filtrage de documents structurés complexes. In Actes du 3ème congrès du chapitre français de l'ISKO (International Society for Knowledge Organization), pages 39–47, July 2001.
François Role.
[BibTeX]

[100]
From contextual grammars to range concatenation grammars. In Sixth Conference on Formal Grammar and Seventh Conference of Mathematics of Language (FG/MOL'01), pages ?–?, University of Helsinki, Helsinki, Finland, August 2001. Electronic Notes in Theoretical Computer Science 53, 12 pages,
Pierre Boullier.
[BibTeX]

[101]
Guided parsing of range concatenation languages. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL'01), pages 42–49, University of Toulouse, France, July 2001.
François Barthélemy, Pierre Boullier, Philippe Deschamp, and Éric Villemonte de La Clergerie.
[BibTeX]

[102]
Atelier ATOLL pour les grammaires d'arbres adjoints. In Proceedings of TALN'01, pages 63–72, Tours, France, July 2001.
François Barthélemy, Pierre Boullier, Philippe Deschamp, Linda Kaouane, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]
Cet article présente l'environnement de travail que nous développons au sein de l'équipe ATOLL pour les grammaires d'arbres adjoints. Cet environnement comprend plusieurs outils et ressources fondés sur l'emploi du langage de balisage XML. Ce langage facilite la mise en forme et l'échange de ressources linguistiques.


[103]
Tools and resources for tree adjoining grammars. In Proceedings of ACL'01 workshop on Sharing Tools and Resources, pages 63–70, Toulouse, France, July 2001.
François Barthélemy, Pierre Boullier, Philippe Deschamp, Linda Kaouane, Abdelaziz Khajour, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]
This paper presents a workbench for Tree Adjoining Grammars that we are currently developing. This workbench includes several tools and resources based on the markup language XML, used as a convenient language to format and exchange linguistic resources.

Divers

[104]
Développement et évaluation d'une grammaire TAG pour le français. Mémoire de DEA, Université Paris 7, September 2001.
Stéphanie Werli.
[BibTeX] [PS Compressed]

[105]
Natural language tabular parsing. Slides for a tutorial delivered at ICLP'01, November 2001,
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]

[106]
ATOLL TAG workbench, May 2001. Slides presented at IRCS, University of Pennsylvania,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

[107]
Serveur de grammaire d'arbres adjoints. Mémoire ingénieur, ENSIAS (Maroc), June 2001.
Adbelaziz Khajour.
[BibTeX] [Word]
Mémoire relatant la mise en place d'un serveur pour accéder à des grammaire d'arbres adjoints (TAG) stockées dans un BD relationnelle. L'accès se fait par l'intermédiaire d'un langage de requêtes spécialisé. L'ensemble est intégré dans un serveur WEB Apache grâce à des Java Servlet et à Coccon.


[108]
Analyse automatique d'un document botanique. Mémoire DESS, Université d'Orléans, 2001.
Stéphanie Balva.
[BibTeX] [Word]
Mémoire de DESS relatant une expérience de découverte de la structure logique d'un corpus botanique et représentation de cette structure en XML. Ce travail a été complété par une interface WEB de navigation.

Année 2000

Livres et monographies

[109]
Philippe Blache and Éric Villemonte de La Clergerie, editors. Actes de la Journée ATALA "Représentation et traitement de l'ambiguité pour l'analyse syntaxique". ATALA, INRIA, January 2000.
[BibTeX] [URL]

Thèses et habilitations à diriger des recherches

[110]
Interpretación tabular de autómatas para lenguajes de adjunción de árboles. PhD thesis, Departamento de Computación, Universidade da Coruña, A Coruña, Spain, September 2000.
Miguel A. Alonso Pardo.
[BibTeX] [URL]

Articles et chapitres de livre

[111]
Métadonnées et structuration des bibliothèques numériques, pages 143–170. INRIA et éditions de l'ADBS, 2000.
François Role.
[BibTeX]

[112]
Tabulation of automata for tree-adjoining languages. Grammars, 3(23), 2000.
Mark-Jan Nederhof, Miguel A. Alonso Pardo, and Éric Villemonte de La Clergerie.
[BibTeX]

[113]
Logiciels libres et entreprises. Terminal, (80/81), 2000.
Bernard Lang.
[BibTeX] [URL]

[114]
Le nouveau protectionnisme est intellectuel. In Olivier Blondeau and Florent Latrive, editors, Libres enfants du savoir numérique. Éditions de l'éclat, Perreux, March 2000. ISBN 2-84162-043-3,
Bernard Lang.
[BibTeX] [URL]

[115]
Internet libère les logiciels. La Recherche, February 2000.
Bernard Lang.
[BibTeX] [URL]

[116]
On TAG parsing. Traitement Automatique des Langues (T.A.L.), 41(3):111–131, 2000. issued June 2001,
Pierre Boullier.
[BibTeX]

[117]
A cubic time extension of context-free grammars. Grammars, 3(23), 2000.
Pierre Boullier.
[BibTeX]

Communications à des congrés, colloques, etc.

[118]
Créer, extraire et manipuler des forêts partagées avec DyALog. In Philippe Blache and Éric Villemonte de La Clergerie, editors, Actes de la Journée ATALA "Représentation et traitement de l'ambiguité pour l'analyse syntaxique". ATALA, INRIA, January 2000.
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
Cet article explicite la nature des forêts d'analyse dans le cadre de grammaires d'unification, de programmes logiques et des grammaires TAG. Nous montrons comment ces forêts peuvent être représentées et extraites d'une execution avec le système DyALog.


[119]
Codex : un système pour la définition de vues multiples guidée par les usages. In M. Gaio et E. trupin, editor, Actes du 3ème Colloque International sur le Document Electronique : CIDE'2000, pages 71–81, July 2000.
I. Majid S. Chaudiron, F. Role.
[BibTeX]

[120]
Range concatenation grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT2000), pages 53–64, Trento, Italy, February 2000.
Pierre Boullier.
[BibTeX]

[121]
'counting' with range concatenation grammars. In Proceedings of the second AMAST workshop on Algebraic Methods in Language Processing (AMILP 2000), Iowa City, Iowa, USA, May 2000.
Pierre Boullier.
[BibTeX]

[122]
Shared forests can guide parsing. In Proc. of 2nd workshop on Tabulation in Parsing and Deduction (TAPD'00), pages 165–174, Vigo, Spain, September 2000.
François Barthélemy, Pierre Boullier, Philippe Deschamp, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper describes an experiment we have made in order to illustrate a promising method to speed up parsing. A first tabular parser, built from the syntactic skeleton of a unification grammar, parses a sentence and produces a shared forest. This forest is used to guide and speed-up a second tabular parser which performs the unification checks.


[123]
A redefinition of Embedded Push-Down Automata. In Proceedings of the 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), pages 19–26, Université Paris 7, Jussieu, Paris, France, May 2000.
Miguel A. Alonso Pardo, Éric Villemonte de La Clergerie, and Manuel Vilares.
[BibTeX] [PS Compressed]

[124]
A formal definition of bottom-up embedded push-down automata and their tabulation techniques. In Proc. of 2nd workshop on Tabulation in Parsing and Deduction (TAPD'00), pages 101–112, Vigo, Spain, September 2000.
Miguel A. Alonso Pardo, Éric Villemonte de La Clergerie, and Manuel Vilares.
[BibTeX] [PS Compressed]

[125]
New tabular algorithms for LIG parsing. In Proceedings of the 6th International Workshop on Parsing Technologies (IWPT2000), pages 29–40, Trento, Italy, February 2000.
Miguel A. Alonso Pardo, Éric Villemonte de La Clergerie, Jorge Graña, and Manuel Vilares.
[BibTeX] [PS Compressed]
We develop a set of new tabular parsing algorithms for Linear Indexed Grammars, including bottom-up algorithms and Earley-like algorithms with and without the valid prefix property, creating a continuum in which one algorithm can in turn be derived from another. The output of these algorithms is a shared forest in the form of a context-free grammar that encodes all possible derivations for a given input string.


[126]
Practical aspects in compiling tabular TAG parsers. In Proceedings of the 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), pages 27–32, Université Paris 7, Jussieu, Paris, France, May 2000.
Miguel A. Alonso Pardo, Djamé Seddah, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper describes the extension of the system DyALog to compile tabular parsers from Feature Tree Adjoining Grammars. The compilation process uses intermediary 2-stack automata to encode various parsing strategies and a dynamic programming interpretation to break automata derivations into tabulable fragments.

Divers

[127]
Free software / open source: Information society opportunities for europe? Version 1.2, April 2000,
Working group on Libre Software, Information Society Directorate General of the European Commission.
[BibTeX] [PDF]

[128]
Tabulation for natural language processing(slides). September 2000,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]
Slide for an invited presentation at SEPLN'00 (Vigo, Spain).


[129]
Adaptation et utilisation d'un environnement graphique pour les TAG au dessus du système DyALog. Master's thesis, LIFO – Université d'Orléans, September 2000. Mémoire de DEA,
Linda Kaouane.
[BibTeX]

[130]
Tools and resources for tree adjoining grammars. Présenté au groupe de travail TAGML, October 2000,
François Barthélemy, Pierre Boullier, Philippe Deschamp, Linda Kaouane, and Éric Villemonte de La Clergerie.
[BibTeX]

Année 1999

Livres et monographies

[131]
Tabulation et traitement de la langue. ATALA, Cargèse, Corse, France, July 1999. Tutoriel présenté à la 6ème conférence annuelle sur le Traitement Automatique des Langues Naturelles (TALN'99),
Éric Villemonte de La Clergerie.
[BibTeX] [URL]

Articles et chapitres de livre

[132]
Représentation et exploitation de métadonnées complexes. Document numérique. Editions Hermes, pages 75–85, November 1999.
François Role.
[BibTeX]

[133]
La DTD TEI. In Techniques de l'ingénieur - traité informatique, volume H7 158. TO BE FILLED, September 1999.
François Role.
[BibTeX]

[134]
Un brevet pour tuer. Libération, 15 janvier 1999.
Bernard Lang and Jean-Paul Smets.
[BibTeX] [URL]

[135]
Ressources libres et indépendance technologique dans les secteurs de l'information. Techniques et science informatique, 18(8):901–914, October 1999.
Bernard Lang.
[BibTeX] [URL]

[136]
Préface. In Jean-Paul Smets-Solanes and Benoît Faucon, editors, Logiciels Libres - Liberté, Egalite, Business. Éditions Edispher, Paris, April 1999. ISBN 2-911-968-7,
Bernard Lang.
[BibTeX] [URL]

Communications à des congrés, colloques, etc.

[137]
Le document object model (DOM). In Michel Goossens ed., editor, Actes du congrès GUT'99, Lyon - INPL, May 1999.
François Role and Philippe Verdret.
[BibTeX]

[138]
Vers un analyseur syntaxique parallèle. In Proc. of the Fourth International Symposium on Economic Informatics, pages 71–79, Bucharest, Romania, May 1999.
Isabelle Debourges, Gaétan Hains, Sylvie Guilloré, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
Le Traitement Automatique des Langues Naturelles (TALN) est un domaine de recherche en pleine expansion. DyALog, analyseur syntaxique généralisé s'inscrit dans ce cadre. L'ambiguité des grammaires à traiter dans le cas de telles applications conduit à un délai de réponse très long. L'objectif de l'étude de parallélisation était de réduire la complexité du logiciel en vue d'une application à des grammaires du Langage Naturel. L'étude complète de parallélisation de DyALog montre qu'il existe des algorithmes capables d'accélérer considérablement son exécution.


[139]
On TAG parsing. In 6ème conférence annuelle sur le Traitement Automatique des Langues Naturelles (TALN'99), pages 75–84, Cargèse, Corse, France, July 1999.
Pierre Boullier.
[BibTeX]

[140]
On multicomponent TAG parsing. In 6ème conférence annuelle sur le Traitement Automatique des Langues Naturelles (TALN'99), pages 321–326, Cargèse, Corse, France, July 1999.
Pierre Boullier.
[BibTeX]

[141]
A cubic time extension of context-free grammars. In Sixth Meeting on Mathematics of Language (MOL6), pages 37–50, University of Central Florida, Orlando, Florida, USA, July 1999.
Pierre Boullier.
[BibTeX]

[142]
Chinese numbers, mix, scrambling, and range concatenation grammars. In Proceedings of the 9th Conference of the European Chapter of the Association for Computational Linguistics (EACL'99), pages 53–60, Bergen, Norway, June 1999.
Pierre Boullier.
[BibTeX]

[143]
Tabulation of automata for tree adjoining languages. In Sixth Meeting on Mathematics of Language (MOL6), 1999.
Miguel A. Alonso Pardo, David Cabrero Souto, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper provides a common framework to clarify the relationships between different automata and their associated tabulation techniques for Tree Adjoning Languages, a subclass of Mildly Context-Sensitive Languages. We have chosen Logic Push-down Automata working with Linear Indexed Grammars as a starting point. Several tabulation techniques for different parsing strategies are proposed and compared with previous approaches.


[144]
Tabular algorithms for TAG parsing. In Proc. of EACL'99, 1999.
Miguel A. Alonso Pardo, David Cabrero Souto, Manuel Vilares, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex predictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum.

Rapports de recherche et publications internes

[145]
Panorama des travaux en cours dans le domaine des métadonnées. Rapport de recherche RR-3628, INRIA, Rocquencourt, France, February 1999.
François Role.
[BibTeX] [URL]

[146]
On TAG and multicomponent TAG parsing. Research Report RR-3668, INRIA, Rocquencourt, France, April 1999. 19 pages,
Pierre Boullier.
[BibTeX] [URL]

[147]
A cubic time extension of context-free grammars. Research Report RR-3611, INRIA, Rocquencourt, France, January 1999. 28 pages,
Pierre Boullier.
[BibTeX] [URL]

[148]
Chinese numbers, mix, scrambling, and range concatenation grammars. Research Report RR-3614, INRIA, Rocquencourt, France, January 1999. 14 pages,
Pierre Boullier.
[BibTeX] [URL]

Divers

[149]
Multilingual terminology production through an intermediate knowledge level: Knowledge acquisition methods and techniques. Tâche 3.3.2 du Projet LE4-8356 Term–IT, devant être inclus dans le document D3.1, June 1999,
Éric Villemonte de La Clergerie.
[BibTeX]

[150]
Construire des analyseurs syntaxiques tabulaires avec le système DyALog (slides). slides in French presented at the workshop "Outils pour le traitement automatique des langues" organized by ATALA and GdR I3, November 1999,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

[151]
Intégration d'un compilateur de grammaire TAG au sein du système tabulaire DyALog. Master's thesis, TALaNa – Université Paris 7, September 1999.
Djamé Seddah.
[BibTeX]

[152]
Un outil d'aide à la maintenance de traductions. Mémoire d'ingénieur de l'ENSIAS, Université Mohammed V, Maroc, 1999,
Saad Berrada.
[BibTeX]

Année 1998

Livres et monographies

[153]
Éric Villemonte de La Clergerie, editor. Tabulation in Parsing and Deduction (TAPD'98). CNAM, 1998.
[BibTeX] [URL]

Articles et chapitres de livre

[154]
Des logiciels libres à la disposition de tous. Le Monde Diplomatique, page 26, January 1998.
Bernard Lang.
[BibTeX] [URL]
également disponible en allemand, anglais et espagnol


[155]
Information flow in tabular interpretations for generalized push-down automata. Theoretical Computer Science, 199:167–198, 1998.
François Barthélemy and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper presents a general framework for deriving tabular algorithms for a very large class of stack-based computations, not only in context-free parsing but in logic programming as well and more generally for all kinds of “information” domains (abstract domains, constraint domains). Tabular algorithms store traces of computations in a table to achieve computation sharing, which is most useful when dealing with non-deterministic computations. By considering what can be naively described as partial information on stack elements, we interpret these traces as stack fragments. Tuning the exact amount of information present in these traces allows us to improve tabular evaluation of stack-based computations, both by increasing the sharing of partial computations and by unifying different tabular algorithms within the same framework.


[156]
Algoritmos tabulares para el análisis de TAG. Procesamiento del Languaje Natural, 23:157–164, September 1998.
Miguel A. Alonso Pardo, David Cabrero Souto, Éric Villemonte de La Clergerie, and Manuel Vilares Ferro.
[BibTeX] [PS Compressed]

Communications à des congrés, colloques, etc.

[157]
An integrated reading and editing environment for scholarly research on literary works and their handwritten sources. In Rob Akscyn Ian Witten and Frank M. Shipman, editors, Proceedings of the Third ACM Conference on Digital Libraries, pages 144–151, Pittsburgh, PA, June 1998. ACM Press.
Laurent Robert Éric lecolinet, François Role and Laurence Likforman.
[BibTeX] [PDF]

[158]
A tabular interpretation of bottom-up automata for TAG. In Proc. of Workshop TAG+4, 1998.
Éric Villemonte de La Clergerie, Miguel A. Alonso Pardo, and David Cabrero Souto.
[BibTeX] [PS Compressed]
The paper presents a tabular interpretation for Bottom-up 2-Stack Automata, which can describe parsing strategies for TAG and LIG where predictions are forbidden in one of the stacks. The results are also useful for tabulating other existing bottom-up automata models for this kind of languages.


[159]
A tabular interpretation of a class of 2-stack automata. In Proc. of ACL/COLING'98, August 1998.
Éric Villemonte de La Clergerie and Miguel A. Alonso Pardo.
[BibTeX] [PS Compressed] [Slides]
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to purely bottom-up, for LIGs and TAGs. The tabular interpretation ensures, for all strategies, a time complexity in O(n6) and space complexity in O(n5) where n is the length of the input string.


[160]
A generalization of mildly context-sensitive formalisms. In Proceedings of the fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), pages 17–20, University of Pennsylvania, Philadelphia, Pennsylvania, August 1998.
Pierre Boullier.
[BibTeX]

Rapports de recherche et publications internes

[161]
Graph interpolation grammars as context-free automata. Rapport de Recherche RR-3456, INRIA, Rocquencourt, France, July 1998.
John Larchevêque.
[BibTeX] [URL]

[162]
Graph interpolation grammars: a rule-based approach to the incremental parsing of natural languages. Rapport de Recherche RR-3390, INRIA, Rocquencourt, France, March 1998.
John Larchevêque.
[BibTeX] [URL]

[163]
Proposal for a natural language processing syntactic backbone. Rapport de Recherche RR-3342, INRIA, Rocquencourt, France, January 1998.
Pierre Boullier.
[BibTeX] [URL]

Divers

[164]
Étude et implantation modulaire d'algorithmes d'analyse syntaxique pour des grammaires utilisées en langue naturelle (grammaires d'arbres adjoints ou grammaires lexicales fonctionnelles. Mémoire d'Ingénieur CNAM, 1998,
Fernand Sanches.
[BibTeX] [PS Compressed]

[165]
Linux online information on a pc. Rapport de stage, December 1998,
Jie Liu.
[BibTeX]

[166]
Parallélisation de DyALog: étude. Master's thesis, LIFO – Université d'Orléans, 1998.
Isabelle Debourges.
[BibTeX]

Année 1997

Thèses et habilitations à diriger des recherches

[167]
Analyse syntaxique et sémantique avec évaluation d'attributs dans un demi-anneau – application à la linguistique calculatoire. PhD thesis, LIFO – Université d'Orléans, June 1997.
Frédéric Tendeau.
[BibTeX]

Articles et chapitres de livre

[168]
Computing abstract decorations of parse-forests using dynamic programming and algebraic power series. Theoretical Computer Science, 1997.
Frédéric Tendeau.
[BibTeX]

[169]
Logical aspect of conputational linguistics: An introduction. In C. Rétoré, editor, Logical Aspects of Computational Linguistics, number 1328 in Lecture Notes in Artificial Intelligence, pages 1–20. Springer, 1997.
P. Blackburn, M. Dymetman, A. Lecomte, A. Ranta, C. Rétoré, and Éric Villemonte de La Clergerie.
[BibTeX]

Communications à des congrés, colloques, etc.

[170]
An Earley algorithm for generic attribute augmented grammars and applications. In Proc. of IWPT'97, pages 199–209, MIT, Cambridge, MA, September 1997.
Frédéric Tendeau.
[BibTeX]

[171]
Automata-based parsing in dynamic programming for Linear Indexed Grammars. In A. S. Narin'yani, editor, Proc. of DIALOGUE'97 Computational Linguistics and its Applications International Workshop, pages 22–27, Moscow, Russia, June 1997.
Miguel A. Alonso Pardo, Éric Villemonte de la Clergerie, and Manuel Vilares Ferro.
[BibTeX] [PS Compressed]

Divers

[172]
Indexation de termes logiques au sein d'un évaluateur tabulaire de programmes logiques. Master's thesis, LIFO – Université d'Orléans, 1997.
Ludovic Valter.
[BibTeX] [PS]
L'objectif final de ce stage de DEA était d'apporter un mécanisme efficace d'indexation de termes logiques à DyALog, un évaluateur tabulaire de programmes logiques. En effet, l'efficacité d'algorithmes tabulaires repose en grande partie sur l'utilisation de systèmes performants d'indexation en vue de recherches rapides dans une table dynamique d'objets. Dans le cadre de programmes logiques, ces recherches se font sur des termes logiques, modulo des opérations coûteuses, telles l'unification ou la subsomption.

Année 1996

Communications à des congrés, colloques, etc.

[173]
Another facet of LIG parsing. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics (ACL'96), pages 87–94, 1996. also INRIA Research Report RR-2858 (http://www.inria.fr/RRRT/RR-2858.html),
Pierre Boullier.
[BibTeX]

Rapports de recherche et publications internes

[174]
Another facet of LIG parsing. Rapport de Recherche RR-2858, INRIA, Rocquencourt, France, April 1996.
Pierre Boullier.
[BibTeX] [URL]

Année 1995

Communications à des congrés, colloques, etc.

[175]
Stochastic parse-tree recognition by a pushdown automaton. In Proceedings of the fourth international workshop on parsing technologies (IWPT'95), pages 234–249, Prague and Karlovy Vary, Czech Republic, September 1995.
Frédéric Tendeau.
[BibTeX]

[176]
Yet another o(n6) recognition algorithm for mildly context-sensitive languages. In Proceedings of the fourth international workshop on parsing technologies (IWPT'95), pages 34–47, Prague and Karlovy Vary, Czech Republic, September 1995. Also INRIA Research Report RR-2730 (http://www.inria.fr/RRRT/RR-2730.html),
Pierre Boullier.
[BibTeX]

Rapports de recherche et publications internes

[177]
Yet another o(n6) recognition algorithm for mildly context-sensitive languages. Rapport de Recherche RR-2322, INRIA, Rocquencourt, France, November 1995.
Pierre Boullier.
[BibTeX] [URL]

Divers

[178]
Une machine abstraite pour dyalog. Master's thesis, Université PARIS 6, 1995.
Fadi Yehya.
[BibTeX]

Année 1994

Articles et chapitres de livre

[179]
Recognition can be harder then parsing. Computational Intelligence — Intelligence Informatique, 1994.
Bernard Lang.
[BibTeX] [PS Compressed]
The work presented here attempts to bring out some fundamental concepts that underlie some known parsing algorithms, usually called chart or dynamic programming parsers, in the hope of guiding the design of similar algorithms for other formalisms that could be considered for describing the “surface” syntax of languages. The key idea is that chart parsing is essentially equivalent to a simple construction of the intersection of the language (represented by its grammar) with a regular set containing only the input sentence to be parsed (represented by a finite state machine). The resulting grammar for that intersection is precisely what is usually called a shared forest: it represent all parses of a syntactically ambiguous sentence. Since most techniques for processing ill-formed input can be modeled by considering a non-singleton regular set of input sentences, we can expect to generalize these ill-formed input processing techniques to all parsers describable with our approach.

Communications à des congrés, colloques, etc.

[180]
LPDA: Another look at tabulation in logic programming. In Van Hentenryck, editor, Proc. of the 11th International Conference on Logic Programming (ICLP'94), pages 470–486. MIT Press, June 1994.
Éric Villemonte de La Clergerie and Bernard Lang.
[BibTeX] [PS Compressed]
The Logic Push-Down Automaton (LPDA) is introduced as an abstract operational model for the evaluation of logic programs. The LPDA can be used to describe a significant number of evaluation strategies, ranging from the top-down OLD strategy to bottom-up strategies, with or without prediction. Two types of dynamic programming, i.e. tabular, interpretation are defined, one being more efficient but restricted to a subclass of LPDAs. We propose to evaluate a logic program by first compiling it into a LPDA according to some chosen evaluation strategy, and then applying a tabular interpreter to this LPDA. This approach offers great flexibility and generalizes the magic-set transformations. It explains in a more intuitive way some known magic-set variants and their limits, and also suggests new developments.

Rapports de recherche et publications internes

[181]
Dynamic grammar and semantic analysis. Rapport de Recherche RR-2322, INRIA, Rocquencourt, France, August 1994.
Pierre Boullier.
[BibTeX] [URL]

Année 1993

Thèses et habilitations à diriger des recherches

[182]
Automates à piles et programmation dynamique. DyALog : Une application à la programmation en logique. PhD thesis, Université Paris 7, 1993.
Éric Villemonte de La Clergerie.
[BibTeX] [URL]

Communications à des congrés, colloques, etc.

[183]
Layer sharing : an improved structure–sharing framework. In Proc. of POPL'93, pages 345–356, 1993.
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
We present in this paper a structure–sharing framework originally developed for a Dynamic Programming interpreter of Logic Programs called DyALog. This mechanism should be of interest for alternative execution models of PROLOG which maintain multiple computation branches and reuse sub–computations in various contexts (computation sharing). This category includes, besides our Dynamic Programming model, the tabular models (OLDT, SLDAL, XWAM), the “magic-set” models, and the independent AND and OR parallelism with solution sharing models. These models raise the problem of storing vast amount of data, motivating us to discard copying mechanisms in favor of structure–sharing mechanisms. Unfortunately, computation sharing requires joining computation branches and possibly renaming some variables, which generally leads to complex structure–sharing mechanisms. The proposed “layer–sharing” framework succeeds however in remaining understandable and easy to implement.


[184]
How to build quickly an efficient implementation of the domain Prop with DyALog. In Proc. of the 5th workshop on Logic Programming Environments, ILPS'93, 1993.
Philippe Lefèbvre and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
DyALog, a tabular logic program evaluator with a modular architecture, is used to develop quickly an efficient interpreter for logic programs with boolean constraints [CLP(Bool) programs]. This is done by a coupling DyALOg with PECOS, a constraint solver over finite domains. This experiment, done in the context of Abstract Interpretation of logic programs, illustrates the “genericity” of our approach for developing interpretations on various abstract domains and for various semantics.

Année 1992

Communications à des congrés, colloques, etc.

[185]
Garbage collecting the world. In Proc. of POPL'92, Albuquerque (New Mexico), January 1992.
Bernard Lang, Christian Queinnec, and José Piquer.
[BibTeX] [PS Compressed]

[186]
Subsumption–oriented Push–Down Automata. In Springer-Verlag, editor, Proc. of PLILP'92, pages 100–114, 1992.
François P. Barthélemy and Éric. Villemonte de la Clergerie.
[BibTeX] [PS Compressed]
This paper presents Subsumption–oriented Push–Down Automata (SPDA), a very general stack formalism used to describe forest (“AND–OR” tree) traversals. These automata may be used for parsing or the interpretation of logic programs. SPDA allow a Dynamic Programming execution which breaks computations into combinable, sharable and storable sub–computations. They provide computation sharing and operational completeness and solves some of the problems posed by the usual depth–first, left–to–right traversals (as implemented in PROLOG). We give an axiomatization of SPDA and two examples of their use: the evaluation of logic programs and parsing with Tree Adjoining Grammars. SPDA may also serve in other areas such as Constraint Logic Programming, Abstract Interpretations, or Contextual parsing.

Année 1991

Articles et chapitres de livre

[187]
Towards a Uniform Formal Framework for Parsing, pages 153–171. Kluwer Academic Publishers, 1991.
Bernard Lang.
[BibTeX] [PS Compressed]
We show that the informal concept of packed shared forest often used to represent compactly the set of all parses of a sentence w.r.t. a Context-Free Grammar can be seen itself as a CF grammar that generates only thoses parses. This approach gives a better understanding of the real nature of these forest representation, and of the parsing process itself. The approach can be extended to the parsinf of ill-formed input, and to more complex formalisms such as Horn Clauses or Definite Clause Grammars.

Communications à des congrés, colloques, etc.

[188]
A tool for abstract interpretation : Dynamic programming. In Actes JTASPEFL'91, pages 151–156, Bordeaux (FRANCE), October 1991.
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
We briefly recall principal abstract interpretation evaluation algorithms for Logic Programs before presenting DyALog, a Logic Programs Dynamic Programming interpreter likely to be an interesting generic abstract interpretation framework. DyALog ensures answer completeness, termination for finite domains, and computation sharing. Major resolution strategies can be simulated.

Année 1990

Communications à des congrés, colloques, etc.

[189]
DyALog : une implantation des clauses de Horn en programmation dynamique. In Proc. of the 9th Séminaire de Programmation en Logique, pages 207–228. CNET, May 1990.
Éric Villemonte de La Clergerie.
[BibTeX]

Année 1989

Divers

[190]
Automates, programmation dynamique et evaluation de programmes logiques. Mémoire de DEA, Université Paris 7, September 1989.
Éric Villemonte de La Clergerie.
[BibTeX]

Eric de la Clergerie
Home Page