Maximizing Top-down Constraints for Unification-based Systems
<|reference_start|>Maximizing Top-down Constraints for Unification-based Systems: 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.<|reference_end|>
@article{tomuro1996maximizing,
    title={Maximizing Top-down Constraints for Unification-based Systems},
    author={Noriko Tomuro (DePaul University)},
    journal={arXiv preprint arXiv:cmp-lg/9606028},
    year={1996},
    archivePrefix={arXiv},
    eprint={cmp-lg/9606028},
    primaryClass={cmp-lg cs.CL}
}