A parsing algorithm for unification grammar
Computational Linguistics
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Relating complexity to practical performance in parsing with wide-coverage unification grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
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.