Ir al contenido

Documat

A general, sound and efficient natural language parsing algorithm based on syntactic constraints propagation

    1. [1] Centro de Informática Científica de Andalucía
  • Localización: CAEPIA'97: actas / coord. por Asociación Española de Inteligencia Artificial, Vicente J. Botti Navarro Árbol académico, 1997, ISBN 84-8498-765-5, págs. 775-786
  • Idioma: inglés
  • Enlaces
  • Resumen

    • This paper presents a new context-free parsing algorithm based on a bidirectional strictly horizontal strategy which incorporates strong top-down predictions (derivations 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 manipulation and representation of the structures used.

Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno