Efficient sharing in ambiguous parsing

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10045/3934
Información del item - Informació de l'item - Item information
Título: Efficient sharing in ambiguous parsing
Autor/es: Vilares Ferro, Manuel
Palabras clave: Context-free parsing | Dynamic programming | Dynamic frames | Earley parsing | Parse forest | Push-down automata
Fecha de publicación: jul-1994
Editor: Sociedad Española para el Procesamiento del Lenguaje Natural
Cita bibliográfica: VILARES FERRO, Manuel. "Efficient sharing in ambiguous parsing". Procesamiento del lenguaje natural. N. 15 (jul. 1994). ISSN 1135-5948
Resumen: At the outbreak, interest in non-deterministic parsing was due to the fact that it is the context free backbone of some natural language analyzers. In effect, several of them start with a purely context-free parsing phase which generates all possible parses as some kind of sharing structure usually called shared forest. Later, in a second phase, a more elaborate analyzer that takes into account the finer grammatical structure of the language is applied in order to filter out undesirable parses. That implies the existence of a disambiguation process, from which a single tree is to be chosen in the resulting shared forest. In this paper, we study the structure of these forests with respect to optimality of syntactic sharing, in relation to the parsing schema used to produce them and to the number of computations to be applied during the parse process. Finally, we give the guideline to design efficient context-free parsers in relation to both the performance and the implementation techniques.
Patrocinador/es: Eureka Software Factory project; Autonomous Government of Galicia
URI: http://hdl.handle.net/10045/3934
ISSN: 1135-5948
Idioma: eng
Tipo: info:eu-repo/semantics/article
Aparece en las colecciones:Procesamiento del Lenguaje Natural - Nº 15 (julio 1994)

Archivos en este ítem:
Archivos en este ítem:
Archivo Descripción TamañoFormato 
ThumbnailPLN_15_07.pdf1,57 MBAdobe PDFAbrir Vista previa


Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.