Maximizing Top-down Constraints for Unification-based Systems

Details Maximizing Top-down Constraints for Unification-based Systems Maximizing Top-down Constraints for Unification-based Systems

1996-06-20

arxiv.org/abs/cmp-lg/9606028v1

Computer Science

Computation and Language

1 postscript figure, uses psfig.sty and aclap.sty

Scientific paper

A left-corner parsing algorithm with top-down filtering has been reported to show very efficient performance for unification-based systems. However, due to the nontermination of parsing with left-recursive grammars, top-down constraints must be weakened. In this paper, a general method of maximizing top-down constraints is proposed. The method provides a procedure to dynamically compute *restrictor*, a minimum set of features involved in an infinite loop for every propagation path; thus top-down constraints are maximally propagated.

Affiliated with

Also associated with

No associations

Rating

Maximizing Top-down Constraints for Unification-based Systems 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 Maximizing Top-down Constraints for Unification-based Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximizing Top-down Constraints for Unification-based Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-66668