1998/01/26 by Jose F. Quesada
Computer Science · #cmp-lg #cs.CL
published as Proceedings CAEPIA'97, Malaga, Spain. pp. 775-786 · 12 pages, 4 Postscript figures, uses epsfig
arxiv created 1998/01/26 · arxiv updated 2009/11/30
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.