The SCP parsing algorithm : computational framework and formal properties
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/2040
Título: | The SCP parsing algorithm : computational framework and formal properties |
---|---|
Autor/es: | Quesada Moreno, José Francisco |
Palabras clave: | Parsing algorithm | Syntactic Constraint Propagation | Overparsing | Formal kernel | Computational framework | Formal properties |
Fecha de publicación: | sep-1998 |
Editor: | Sociedad Española para el Procesamiento del Lenguaje Natural |
Cita bibliográfica: | QUESADA MORENO, José Francisco. “The SCP parsing algorithm : computational framework and formal properties”. Procesamiento del lenguaje natural. Nº 23 (sept. 1998), pp. 149-156 |
Resumen: | This paper presents a new parsing algorithm for unrestricted context-free grammars. Basically, it may be described as a bidirectional bottom-up parser that is driven by an event generation strategy and is based on a sophisticated Syntactic Constraint Propagation (SCP) technique which uses strong top-down predictions. First, we motivate the new algorithm by discussing the notion of overparsing. Next, we present the formal kernel of the algorithm (based on the relations of partial derivability and adjacency) and a detailed description of the algorithm. Finally, the paper presents some important results from three perspectives: linguistic, computational and formal. |
URI: | http://hdl.handle.net/10045/2040 |
ISSN: | 1135-5948 |
Idioma: | eng |
Tipo: | info:eu-repo/semantics/article |
Aparece en las colecciones: | Procesamiento del Lenguaje Natural - Nº 23 (septiembre 1998) |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
PLN_23_21.pdf | 252,28 kB | Adobe PDF | Abrir Vista previa | |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.