A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation
<|reference_start|>A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation: 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.<|reference_end|>
@article{quesada1998a,
    title={A General, Sound and Efficient Natural Language Parsing Algorithm based
  on Syntactic Constraints Propagation},
    author={Jose F. Quesada},
    journal={Proceedings CAEPIA'97, Malaga, Spain. pp. 775-786},
    year={1998},
    archivePrefix={arXiv},
    eprint={cmp-lg/9801005},
    primaryClass={cmp-lg cs.CL}
}