Maximizing Top-down Constraints for Unification-based Systems
Download:
|
|
by Noriko Tomuro
http://condor.depaul.edu/~ntomuro/papers/acl96/acl96.ps
Add To MetaCart
Abstract:
A left-corner parsing algorithm with topdown filtering has been reported to show very efficient performance for unificationbased 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.
Citations
| 387 | An Introduction to Unification-Based Approaches to Grammar – Shieber - 1986 |
| 90 | Using restriction to extend parsing algorithms for complex-feature-based formalisms – Shieber - 1985 |
| 36 | Relating Complexity to Practical Performance in Parsing with Wide-coverage Unification Grammars – Carroll - 1994 |
| 22 | A parsing algorithm for unification grammar – Haas - 1989 |
| 16 | Experiments with GLR and chart parsing – Shann - 1991 |
| 6 | A unification-based, integrated natural language processing system – Lytinen - 1992 |
| 4 | Avoiding non-termination in unification grammars – Samuelsson - 1993 |
