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 2004

Articles et chapitres de livre

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

Année 2001

Articles et chapitres de livre

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

Année 2000

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

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

Communications à des congrés, colloques, etc.

[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.

Année 1999

Communications à des congrés, colloques, etc.

[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.

Année 1998

Articles et chapitres de livre

[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.

[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.


Année 1997

Communications à des congrés, colloques, etc.

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

Eric de la Clergerie
Home Page