Prediction in Chart Parsing Algorithms for Categorial Unification Grammar

2Citations
Citations of this article
72Readers
Mendeley users who have this article in their library.

Abstract

Natural language systems based on Categorial Unification Grammar (CUG) have mainly employed bottomup 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 thai this may lead to considerable gains in efficiency for both bottom-up and top-down parsing.

Cite

CITATION STYLE

APA

Bouma, G. (1991). Prediction in Chart Parsing Algorithms for Categorial Unification Grammar. In 5th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1991 - Proceedings (pp. 179–184). Association for Computational Linguistics (ACL). https://doi.org/10.3115/977180.977211

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free