Paper: Maximizing Top-Down Constraints For Unification-Based Systems

ACL ID P96-1058
Title Maximizing Top-Down Constraints For Unification-Based Systems
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1996
Authors

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 non- termination of parsing with left-recursive grammars, top-down constraints must be weakened. In this paper, a general method of maximizing top-down constraints is pro- posed. The method provides a procedure to dynamically compute *restrictor. , a minimum set of features involved in an in- finite loop for every propagation path; thus top-down constraints are maximally prop- agated.