Parsing parallel grammatical representations

0Citations
Citations of this article
73Readers
Mendeley users who have this article in their library.

Abstract

Traditional accounts of quantifier scope employ qualitative constraints or rules to account for scoping preferences. This paper outlines a feature-based parsing algorithm for a grammar with multiple simultaneous levels of representation, one of which corresponds to a partial ordering among quantifiers according to scope. The optimal such ordering (as well as the ranking of other orderings) is determined in this grammar not by absolute constraints, but by stochastic heuristics based on the degree of alignment among the representational levels. A Prolog implementation is described and its accuracy is compared with that of other accounts.

Cite

CITATION STYLE

APA

Higgins, D. (1998). Parsing parallel grammatical representations. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1, pp. 545–549). Association for Computational Linguistics (ACL). https://doi.org/10.3115/980845.980936

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