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



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

Key search

Année 1998

Livres et monographies

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

Articles et chapitres de livre

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

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.

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.

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]

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.

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.

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.

Rapports de recherche et publications internes

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

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]

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


É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]

Linux online information on a pc. Rapport de stage, December 1998,
Jie Liu.

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

Eric de la Clergerie
Home Page