Maximizing top-down constraints for unification-based systems
Noriko Tomuro · 1996
A left-corner parsing algorithm with topdown 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 maximizng 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.