Computer Science – Computation and Language
Scientific paper
1998-01-26
Proceedings CAEPIA'97, Malaga, Spain. pp. 775-786
Computer Science
Computation and Language
12 pages, 4 Postscript figures, uses epsfig
Scientific paper
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.
No associations
LandOfFree
A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-375416