Algoritmos de análisis para gramáticas de inserción de árboles

Tree Insertion Grammar (TIG) is a compromise between Context Free Grammar (CFG) and Tree Adjoining Grammar (TAG) that can be parsed in O(n3)- time. In the literature, just two parsers for TIGs have been defined, based on the well-known CYK and Earley algorithms for CFGs. In this paper, we define four new parsers for TIGs: three parsers use a bottom-up strategy and the other one uses a predictive bottom-up strategy.

[1]  Víctor J. Díaz Madrigal.  Gramáticas de Adjunción de Árboles: Un Enfoque Deductivo en el Análisis Sintáctico , 2002, Proces. del Leng. Natural.

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

[3]  David J. Weir,et al.  A Structure-Sharing Parser for Lexicalized Grammars , 1998, COLING-ACL.

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

[5]  Richard C. Waters,et al.  Tree Insertion Grammar: A Cubic-Time, Parsable Formalism that Lexicalizes Context-Free Grammar without Changing the Trees Produced , 1995, CL.

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

[7]  Vicente Carrillo Montero,et al.  Left Corner Parser for Tree Insertion Grammars , 2002, AIMSA.

[8]  Richard C. Waters,et al.  Stochastic Lexicalized Tree-Insertion Grammar , 1996 .

[9]  Beth Ann Hockey,et al.  XTAG System - A Wide Coverage Grammar for English , 1994, COLING.

[10]  Aravind K. Joshi,et al.  Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.

[11]  Vicente Carrillo,et al.  A Predictive Left-Corner Parser for Tree Adjoining Grammars , 2002 .

[12]  Gertjan van Noord.  HEAD‐CORNER PARSING FOR TAG , 1994, Comput. Intell..

[13]  Vicente Carrillo,et al.  A Bidirectional Bottom-up Parser for TAG , 2000, IWPT.

[14]  Miguel A. Alonso,et al.  Análisis sintáctico ascendente de TAGs guiado por la esquina izquierda , 2001, Proces. del Leng. Natural.

[15]  Miguel A. Alonso.  Interpretación tabular de autómatas para lenguajes de adjunción de árboles , 2002, Proces. del Leng. Natural.

[16]  Miguel A. Alonso,et al.  Análisis eficiente de Graḿaticas de Insercíon deÁrboles , 2002 .

[17]  A Left Corner Parser for Tree Adjoining Grammars , 2002, TAG+.

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