Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A tractable extension of Linear Indexed Grammars
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Computing first and follow functions for feature theoretic grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A context-free superset approximation of unification-based grammars
New developments in parsing technology
| Hi-index | 0.00 |
Shieber (1987) describes a technique for limiting the number of active edges introduced into a chart by top-down prediction in chart parsers for PATR grammars, without affecting the correctness or completeness of the parser. That technique, termed restriction, is extendable to other parsing algorithms. It can be employed to increase parsing efficiency and to induce termination for some classes of grammars that would not otherwise terminate.Here, we describe one class of grammars for which restriction, as described by Shieber, induces non-termination. We do not suggest that the concept of restriction is fatally flawed, however. On the contrary, relatively minor modifications to the implementation of restriction can make it a more flexible tool for fine-tuning PATR grammars.