Maximizing Top-down Constraints for Unification-based Systems
cmp-lg
2008-02-03 v1 计算与语言
摘要
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.
引用
@article{arxiv.cmp-lg/9606028,
title = {Maximizing Top-down Constraints for Unification-based Systems},
author = {Noriko Tomuro},
journal= {arXiv preprint arXiv:cmp-lg/9606028},
year = {2008}
}
备注
1 postscript figure, uses psfig.sty and aclap.sty