论文信息 - Estudio comparativo del rendimiento de analizadores sintácticos para gramáticas de adjunción de árboles

Estudio comparativo del rendimiento de analizadores sintácticos para gramáticas de adjunción de árboles

Parcialmente financiado por Ministerio de Educacion y Ciencia y FEDER (TIN2004-07246-C03-01, TIN2004-07246-C03-02), Xunta de Galicia (PGIDIT05PXIC30501PN, PGIDIT05PXIC10501PN y PGIDIT05SIN044E), y Programa de becas FPU (Ministerio de Educacion y Ciencia).

Miguel A. Alonso | Manuel Vilares Ferro | Carlos Gómez-Rodríguez

[1] Miguel A. Alonso,et al. Generación automática de analizadores sintácticos a partir de esquemas de análisis , 2005, Proces. del Leng. Natural.

[2] Stuart M. Shieber,et al. Principles and Implementation of Deductive Parsing , 1994, J. Log. Program..

[3] C Ǵ-Rı,et al. On theoretical and practical complexity of TAG parsers , 2007 .

[4] Klaas Sikkel,et al. Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms , 2002 .

[5] Aravind K. Joshi,et al. Some Computational Properties of Tree Adjoining Grammars , 1985, ACL.

[6] Miguel A. Alonso,et al. Tabular Algorithms for TAG Parsing , 1999, EACL.

[7] Miguel A. Alonso,et al. Automatic Generation of Natural Language Parsers from Declarative Specifications , 2006, STAIRS.

[8] XTAG Research Group,et al. A Lexicalized Tree Adjoining Grammar for English , 1998, ArXiv.

[9] Yves Schabes,et al. LEFT TO RIGHT PARSING OF LEXICALIZED TREE‐ADJOINING GRAMMARS 1 , 1994, Comput. Intell..

[10] Aravind K. Joshi,et al. Parsing with Lexicalized Tree Adjoining Grammar , 1991 .

[11] Miguel A. Alonso,et al. Generating XTAG Parsers from Algebraic Specifications , 2006, TAG.

[12] Mark-Jan Nederhof,et al. The Computational Complexity of the Correct-Prefix Property for TAGs , 1999, Comput. Linguistics.

[13] Miguel A. Alonso,et al. Comparing tabular parsers for Tree Adjoining Grammars , 2000 .