An algorithm for generating non-redundant quantifier scopings

Authors:
Espen J. Vestre
Affiliations:
University of Oslo, Oslo, Norway
Venue:
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Year:
1991

Citing 3
Cited 5

An algorithm for generating quantifier scopings

Computational Linguistics
PROLOG and Natural Language Analysis

PROLOG and Natural Language Analysis
Semantic abstraction and anaphora

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1

Quantifier scope and constituency

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Focus on "only" and "not"

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
An improved redundancy elimination algorithm for underspecified representations

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Computing weakest readings

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Flexible disambiguation in DTS

CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an algorithm for generating quantifier scopings. The algorithm is designed to generate only logically non-redundant scopings and to partially order the scopings with a given default scoping first. Removing logical redundancy is not only interesting per se, but also drastically reduces the processing time. The input and output formats are described through a few access and construction functions. Thus, the algorithm is interesting for a modular linguistic theory, which is flexible with respect to syntactic and semantic framework.