Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
A flexible graph-unification formalism and its application to natural-language processing
IBM Journal of Research and Development
A parsing algorithm for unification grammar
Computational Linguistics
PROLOG and Natural Language Analysis
PROLOG and Natural Language Analysis
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Categorial unification grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Unification Categorial Grammar: a concise, extendable grammar for natural language processing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Head-driven parsing for lexicalist grammars: experimental results
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Top-down predictive linking and complex-feature-based formalisms
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
Natural language systems based on Categorial Unification Grammar (CUG) have mainly employed bottom-up parsing algorithms for processing. Conventional prediction techniques to improve the efficiency of the parsing process, appear to fall short when parsing CUG. Nevertheless, prediction seems necessary when parsing grammars with highly ambiguous lexicons or with noncanonical categorial rules. In this paper we present a lexicalist prediction technique for CUG and show that this may lead to considerable gains in efficiency for both bottom-up and top-down parsing.