Parsing parallel grammatical representations

Authors:
Derrick Higgins
Affiliations:
University of Chicago, Chicago, IL
Venue:
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Year:
1998

Citing 4
Cited 0

An algorithm for generating quantifier scopings

Computational Linguistics
Prolog and natural-language analysis

Prolog and natural-language analysis
Quantifier scope and constituency

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Quantifier scoping in the SRI core language engine

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.02

Visualization

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.