A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation

Simple item page
dc.creatorQuesada, Jose F.
dc.date1998-01-26
dc.date.accessioned2026-07-07T02:36:11Z
dc.date.available2026-07-07T02:36:11Z
dc.descriptionThis 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.
dc.description12 pages, 4 Postscript figures, uses epsfig
dc.identifierhttps://arxiv.org/abs/cmp-lg/9801005
dc.identifierhttp://arxiv.org/abs/cmp-lg/9801005
dc.identifierProceedings CAEPIA'97, Malaga, Spain. pp. 775-786
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/15826
dc.subjectComputation and Language
dc.titleA General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation
dc.typetext

Files

Collections

arXiv