The SCP parsing algorithm : computational framework and formal properties
Empreu sempre aquest identificador per citar o enllaçar aquest ítem
http://hdl.handle.net/10045/2040
Títol: | The SCP parsing algorithm : computational framework and formal properties |
---|---|
Autors: | Quesada Moreno, José Francisco |
Paraules clau: | Parsing algorithm | Syntactic Constraint Propagation | Overparsing | Formal kernel | Computational framework | Formal properties |
Data de publicació: | de setembre-1998 |
Editor: | Sociedad Española para el Procesamiento del Lenguaje Natural |
Citació 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 |
Resum: | 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 |
Tipus: | info:eu-repo/semantics/article |
Apareix a la col·lecció: | Procesamiento del Lenguaje Natural - Nº 23 (septiembre 1998) |
Arxius per aquest ítem:
Arxiu | Descripció | Tamany | Format | |
---|---|---|---|---|
PLN_23_21.pdf | 252,28 kB | Adobe PDF | Obrir Vista prèvia | |
Tots els documents dipositats a RUA estan protegits per drets d'autors. Alguns drets reservats.