Ponencia
Parsing TAGs with Prolog
Autor/es | Díaz Madrigal, Víctor Jesús
Toro Bonilla, Miguel |
Departamento | Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos |
Fecha de publicación | 1997 |
Fecha de depósito | 2023-01-23 |
Publicado en |
|
Resumen | Among formalisms for the computation of syntactic description of natural language sentences, Tree Adjoining Grammars (TAG) play a major role. Several classical Context Free Grammars (CFGs) parsers have been redefined for ... Among formalisms for the computation of syntactic description of natural language sentences, Tree Adjoining Grammars (TAG) play a major role. Several classical Context Free Grammars (CFGs) parsers have been redefined for TAGs , but it is not frequent to find in the literature references to parsing TAGs from a logic programming point of view. In this paper , we will concentrate on this direction, presenting a pure top-down left-to-rigth recognizer algorithm for TAG, using Prolog, that reduces the problems found in the translation of Lang's axiomatization. Actually, the algorithm is a parser that, given a grammatical input, produces the parse forest using a compact representation of every parse tree. Also, a rule represenltation of TAG's elementary trees is introduced in order to write grammars that can be compiled directly into Prolog predicates in a similar way that traditionally Definite Clause Grammars (DCGs) does respect to CPGs. |
Cita | Díaz Madrigal, V.J. y Toro Bonilla, M. (1997). Parsing TAGs with Prolog. En APPIA-GULP-PRODE, 1997 (359-368), Grado, Italia: dblp computer science bibliography. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Parsing TAGs with Prolog.pdf | 1.221Mb | [PDF] | Ver/ | |