Maximizing Top-down Constraints for Unification-based Systems
| dc.creator | Tomuro, Noriko | |
| dc.date | 1996-06-20 | |
| dc.date.accessioned | 2026-07-07T09:10:25Z | |
| dc.date.available | 2026-07-07T09:10:25Z | |
| dc.description | 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. | |
| dc.description | 1 postscript figure, uses psfig.sty and aclap.sty | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9606028 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9606028 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151347 | |
| dc.subject | Computation and Language | |
| dc.title | Maximizing Top-down Constraints for Unification-based Systems | |
| dc.type | text |