论文信息 - Bidirectional parsing of TAG without heads

Bidirectional parsing of TAG without heads

We present a bottom-up bidirectional parser for Tree Adjoining Grammars that is an extension of the parser defined by De Vreught and Honig for Context Free Grammars. Although this parser does not improve the complexity of the parsers defined in the literature, it presents several characteristics that can be of interest for practical parsing of natural languages.

Vicente Carrillo | Miguel A. Alonso | Víctor J. Díaz Madrigal

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

[2] Giorgio Satta,et al. Bidirectional Parsing of Lexicalized Tree Adjoining Grammars , 1991, EACL.

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

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

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

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

[7] Patrice Lopez,et al. Extended Partial Parsing for Lexicalized Tree Grammars , 2000, IWPT.

[8] Anne Abeillé,et al. A Lexicalized Tree Adjoining Grammar for English , 1990 .

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