Ponencia
A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation
Autor/es | Quesada Moreno, José Francisco |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 1997 |
Fecha de depósito | 2019-05-31 |
Publicado en |
|
Resumen | This paper presents a new context-free parsing algorithm based on a bidirectional
strictly horizontal strategy which incorporates strong top–down predictions (deriva-
tions and adjacencies). From a functional point of ... This paper presents a new context-free parsing algorithm based on a bidirectional strictly horizontal strategy which incorporates strong top–down predictions (deriva- tions and adjacencies). From a functional point of view, the parser is able to propagate syntactic constraints reducing parsing ambiguity. From a computational perspective, the algorithm includes different techniques aimed at the improvement of the manipu- lation and representation of the structures used. |
Cita | Quesada Moreno, J.F. (1997). A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation. En CAEPIA 1997: VII Conferencia de la Asociación Española para la Inteligencia Artificial (775-786), Torremolinos, Málaga: AEPIA: Asociación Española para la Inteligencia Artificial. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
A General, Sound and Efficient ... | 147.9Kb | [PDF] | Ver/ | |