Connection relations and quantifier scope

Authors:
Longin Latecki
Affiliations:
University of Hamburg, Hamburg, Germany
Venue:
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Year:
1992

Citing 4
Cited 1

An algorithm for generating quantifier scopings

Computational Linguistics
Remarks on plural anaphora

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
An indexing technique for implementing command relations

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Plurals, cardinalities, and structures of determination

COLING '86 Proceedings of the 11th coference on Computational linguistics

Quantifier scope disambiguation using extracted pragmatic knowledge: preliminary results

EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3

Quantified Score

Hi-index	0.00

Visualization

Abstract

A formalism will be presented in this paper which makes it possible to realise the idea of assigning only one scope-ambiguous representation to a sentence that is ambiguous with regard to quantifier scope. The scope determination results in extending this representation with additional context and world knowledge conditions. If there is no scope determining information, the formalism can work further with this scope-ambiguous representation. Thus scope information does not have to be completely determined.